/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 10:26:38,498 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 10:26:38,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 10:26:38,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 10:26:38,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 10:26:38,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 10:26:38,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 10:26:38,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 10:26:38,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 10:26:38,541 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 10:26:38,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 10:26:38,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 10:26:38,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 10:26:38,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 10:26:38,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 10:26:38,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 10:26:38,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 10:26:38,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 10:26:38,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 10:26:38,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 10:26:38,549 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 10:26:38,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 10:26:38,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 10:26:38,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 10:26:38,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 10:26:38,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 10:26:38,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 10:26:38,555 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 10:26:38,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 10:26:38,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 10:26:38,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 10:26:38,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 10:26:38,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 10:26:38,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 10:26:38,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 10:26:38,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 10:26:38,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 10:26:38,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 10:26:38,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 10:26:38,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 10:26:38,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 10:26:38,561 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 10:26:38,561 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 10:26:38,567 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 10:26:38,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 10:26:38,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 10:26:38,568 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 10:26:38,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 10:26:38,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 10:26:38,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 10:26:38,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 10:26:38,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 10:26:38,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 10:26:38,569 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 10:26:38,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 10:26:38,569 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 10:26:38,569 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 10:26:38,569 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 10:26:38,569 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 10:26:38,570 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 10:26:38,570 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 10:26:38,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 10:26:38,570 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 10:26:38,570 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 10:26:38,570 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 10:26:38,570 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 10:26:38,571 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 10:26:38,571 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 10:26:38,571 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 10:26:38,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 10:26:38,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 10:26:38,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 10:26:38,742 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 10:26:38,743 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 10:26:38,743 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_unwindbound1.c [2022-04-15 10:26:38,795 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2782da2e/95dd15f55e974ad1aa2ebc1274ddf025/FLAG4b9a1760e [2022-04-15 10:26:39,151 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 10:26:39,151 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_unwindbound1.c [2022-04-15 10:26:39,155 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2782da2e/95dd15f55e974ad1aa2ebc1274ddf025/FLAG4b9a1760e [2022-04-15 10:26:39,163 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2782da2e/95dd15f55e974ad1aa2ebc1274ddf025 [2022-04-15 10:26:39,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 10:26:39,165 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 10:26:39,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 10:26:39,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 10:26:39,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 10:26:39,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:26:39" (1/1) ... [2022-04-15 10:26:39,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a6ba6e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:26:39, skipping insertion in model container [2022-04-15 10:26:39,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:26:39" (1/1) ... [2022-04-15 10:26:39,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 10:26:39,184 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 10:26:39,332 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_unwindbound1.c[537,550] [2022-04-15 10:26:39,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 10:26:39,363 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 10:26:39,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_unwindbound1.c[537,550] [2022-04-15 10:26:39,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 10:26:39,399 INFO L208 MainTranslator]: Completed translation [2022-04-15 10:26:39,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:26:39 WrapperNode [2022-04-15 10:26:39,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 10:26:39,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 10:26:39,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 10:26:39,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 10:26:39,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:26:39" (1/1) ... [2022-04-15 10:26:39,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:26:39" (1/1) ... [2022-04-15 10:26:39,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:26:39" (1/1) ... [2022-04-15 10:26:39,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:26:39" (1/1) ... [2022-04-15 10:26:39,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:26:39" (1/1) ... [2022-04-15 10:26:39,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:26:39" (1/1) ... [2022-04-15 10:26:39,432 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:26:39" (1/1) ... [2022-04-15 10:26:39,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 10:26:39,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 10:26:39,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 10:26:39,434 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 10:26:39,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:26:39" (1/1) ... [2022-04-15 10:26:39,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 10:26:39,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:26:39,457 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 10:26:39,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 10:26:39,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 10:26:39,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 10:26:39,486 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 10:26:39,486 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 10:26:39,486 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 10:26:39,486 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 10:26:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 10:26:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 10:26:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 10:26:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 10:26:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 10:26:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 10:26:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 10:26:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 10:26:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 10:26:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 10:26:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 10:26:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 10:26:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 10:26:39,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 10:26:39,534 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 10:26:39,535 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 10:26:39,698 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 10:26:39,703 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 10:26:39,703 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 10:26:39,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:26:39 BoogieIcfgContainer [2022-04-15 10:26:39,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 10:26:39,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 10:26:39,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 10:26:39,708 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 10:26:39,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 10:26:39" (1/3) ... [2022-04-15 10:26:39,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d50a68e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:26:39, skipping insertion in model container [2022-04-15 10:26:39,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:26:39" (2/3) ... [2022-04-15 10:26:39,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d50a68e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:26:39, skipping insertion in model container [2022-04-15 10:26:39,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:26:39" (3/3) ... [2022-04-15 10:26:39,709 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll_unwindbound1.c [2022-04-15 10:26:39,712 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 10:26:39,712 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 10:26:39,738 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 10:26:39,741 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 10:26:39,742 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 10:26:39,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:26:39,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 10:26:39,757 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:26:39,757 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:26:39,758 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:26:39,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:26:39,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1523633710, now seen corresponding path program 1 times [2022-04-15 10:26:39,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:26:39,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1368500046] [2022-04-15 10:26:39,806 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:26:39,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1523633710, now seen corresponding path program 2 times [2022-04-15 10:26:39,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:26:39,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144391713] [2022-04-15 10:26:39,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:26:39,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:26:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:26:39,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 10:26:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:26:39,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID [2022-04-15 10:26:39,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-15 10:26:39,985 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #65#return; {33#true} is VALID [2022-04-15 10:26:39,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 10:26:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:26:39,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-15 10:26:39,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-15 10:26:39,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-15 10:26:39,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-15 10:26:39,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {42#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 10:26:39,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID [2022-04-15 10:26:39,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-15 10:26:39,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #65#return; {33#true} is VALID [2022-04-15 10:26:39,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-15 10:26:40,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {33#true} is VALID [2022-04-15 10:26:40,000 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {33#true} is VALID [2022-04-15 10:26:40,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-15 10:26:40,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-15 10:26:40,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-15 10:26:40,001 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-15 10:26:40,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {34#false} is VALID [2022-04-15 10:26:40,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-15 10:26:40,002 INFO L272 TraceCheckUtils]: 13: Hoare triple {34#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {34#false} is VALID [2022-04-15 10:26:40,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-15 10:26:40,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-15 10:26:40,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-15 10:26:40,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 10:26:40,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:26:40,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144391713] [2022-04-15 10:26:40,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144391713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:26:40,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:26:40,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 10:26:40,016 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:26:40,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1368500046] [2022-04-15 10:26:40,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1368500046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:26:40,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:26:40,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 10:26:40,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2228999] [2022-04-15 10:26:40,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:26:40,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 10:26:40,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:26:40,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 10:26:40,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:26:40,050 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 10:26:40,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:26:40,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 10:26:40,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 10:26:40,071 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 10:26:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:26:40,202 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 10:26:40,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 10:26:40,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 10:26:40,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:26:40,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 10:26:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-15 10:26:40,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 10:26:40,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-15 10:26:40,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-04-15 10:26:40,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:26:40,290 INFO L225 Difference]: With dead ends: 52 [2022-04-15 10:26:40,290 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 10:26:40,292 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 10:26:40,294 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:26:40,295 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 35 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:26:40,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 10:26:40,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-15 10:26:40,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:26:40,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:26:40,315 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:26:40,316 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:26:40,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:26:40,319 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-15 10:26:40,319 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 10:26:40,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:26:40,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:26:40,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-15 10:26:40,321 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-15 10:26:40,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:26:40,324 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-15 10:26:40,326 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 10:26:40,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:26:40,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:26:40,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:26:40,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:26:40,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:26:40,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-15 10:26:40,335 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2022-04-15 10:26:40,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:26:40,335 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-15 10:26:40,336 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 10:26:40,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-15 10:26:40,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:26:40,363 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 10:26:40,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 10:26:40,364 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:26:40,364 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:26:40,364 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 10:26:40,365 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:26:40,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:26:40,366 INFO L85 PathProgramCache]: Analyzing trace with hash -991958694, now seen corresponding path program 1 times [2022-04-15 10:26:40,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:26:40,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1397436157] [2022-04-15 10:26:40,368 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:26:40,368 INFO L85 PathProgramCache]: Analyzing trace with hash -991958694, now seen corresponding path program 2 times [2022-04-15 10:26:40,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:26:40,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587429732] [2022-04-15 10:26:40,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:26:40,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:26:40,397 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:26:40,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1283933277] [2022-04-15 10:26:40,398 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:26:40,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:26:40,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:26:40,400 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:26:40,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 10:26:40,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 10:26:40,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:26:40,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 10:26:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:26:40,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:26:40,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {251#true} is VALID [2022-04-15 10:26:40,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {259#(<= ~counter~0 0)} is VALID [2022-04-15 10:26:40,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {259#(<= ~counter~0 0)} assume true; {259#(<= ~counter~0 0)} is VALID [2022-04-15 10:26:40,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {259#(<= ~counter~0 0)} {251#true} #65#return; {259#(<= ~counter~0 0)} is VALID [2022-04-15 10:26:40,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {259#(<= ~counter~0 0)} call #t~ret7 := main(); {259#(<= ~counter~0 0)} is VALID [2022-04-15 10:26:40,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {259#(<= ~counter~0 0)} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {259#(<= ~counter~0 0)} is VALID [2022-04-15 10:26:40,601 INFO L272 TraceCheckUtils]: 6: Hoare triple {259#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {259#(<= ~counter~0 0)} is VALID [2022-04-15 10:26:40,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {259#(<= ~counter~0 0)} ~cond := #in~cond; {259#(<= ~counter~0 0)} is VALID [2022-04-15 10:26:40,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {259#(<= ~counter~0 0)} assume !(0 == ~cond); {259#(<= ~counter~0 0)} is VALID [2022-04-15 10:26:40,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {259#(<= ~counter~0 0)} assume true; {259#(<= ~counter~0 0)} is VALID [2022-04-15 10:26:40,602 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {259#(<= ~counter~0 0)} {259#(<= ~counter~0 0)} #59#return; {259#(<= ~counter~0 0)} is VALID [2022-04-15 10:26:40,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {259#(<= ~counter~0 0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {259#(<= ~counter~0 0)} is VALID [2022-04-15 10:26:40,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {259#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {293#(<= |main_#t~post6| 0)} is VALID [2022-04-15 10:26:40,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {293#(<= |main_#t~post6| 0)} assume !(#t~post6 < 1);havoc #t~post6; {252#false} is VALID [2022-04-15 10:26:40,608 INFO L272 TraceCheckUtils]: 14: Hoare triple {252#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {252#false} is VALID [2022-04-15 10:26:40,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {252#false} ~cond := #in~cond; {252#false} is VALID [2022-04-15 10:26:40,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {252#false} assume 0 == ~cond; {252#false} is VALID [2022-04-15 10:26:40,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-04-15 10:26:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 10:26:40,609 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 10:26:40,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:26:40,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587429732] [2022-04-15 10:26:40,609 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:26:40,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283933277] [2022-04-15 10:26:40,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283933277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:26:40,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:26:40,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 10:26:40,611 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:26:40,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1397436157] [2022-04-15 10:26:40,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1397436157] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:26:40,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:26:40,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 10:26:40,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926605275] [2022-04-15 10:26:40,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:26:40,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-15 10:26:40,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:26:40,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 10:26:40,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:26:40,630 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 10:26:40,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:26:40,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 10:26:40,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 10:26:40,631 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 10:26:40,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:26:40,677 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-15 10:26:40,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 10:26:40,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-15 10:26:40,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:26:40,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 10:26:40,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-15 10:26:40,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 10:26:40,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-15 10:26:40,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-15 10:26:40,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:26:40,702 INFO L225 Difference]: With dead ends: 34 [2022-04-15 10:26:40,702 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 10:26:40,702 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 10:26:40,703 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:26:40,703 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:26:40,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 10:26:40,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 10:26:40,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:26:40,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:26:40,714 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:26:40,714 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:26:40,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:26:40,715 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-15 10:26:40,715 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 10:26:40,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:26:40,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:26:40,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 10:26:40,716 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 10:26:40,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:26:40,717 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-15 10:26:40,717 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 10:26:40,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:26:40,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:26:40,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:26:40,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:26:40,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:26:40,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-15 10:26:40,719 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 18 [2022-04-15 10:26:40,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:26:40,719 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-15 10:26:40,719 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 10:26:40,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-15 10:26:40,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:26:40,745 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 10:26:40,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 10:26:40,746 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:26:40,746 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:26:40,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 10:26:40,955 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:26:40,955 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:26:40,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:26:40,956 INFO L85 PathProgramCache]: Analyzing trace with hash -990171234, now seen corresponding path program 1 times [2022-04-15 10:26:40,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:26:40,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1396635402] [2022-04-15 10:26:40,956 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:26:40,956 INFO L85 PathProgramCache]: Analyzing trace with hash -990171234, now seen corresponding path program 2 times [2022-04-15 10:26:40,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:26:40,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783597313] [2022-04-15 10:26:40,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:26:40,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:26:40,979 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:26:40,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1896557711] [2022-04-15 10:26:40,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:26:40,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:26:40,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:26:40,981 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:26:40,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 10:26:41,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 10:26:41,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:26:41,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 10:26:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:26:41,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:26:41,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {484#true} call ULTIMATE.init(); {484#true} is VALID [2022-04-15 10:26:41,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {484#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {484#true} is VALID [2022-04-15 10:26:41,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {484#true} assume true; {484#true} is VALID [2022-04-15 10:26:41,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {484#true} {484#true} #65#return; {484#true} is VALID [2022-04-15 10:26:41,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {484#true} call #t~ret7 := main(); {484#true} is VALID [2022-04-15 10:26:41,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {484#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {484#true} is VALID [2022-04-15 10:26:41,129 INFO L272 TraceCheckUtils]: 6: Hoare triple {484#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {484#true} is VALID [2022-04-15 10:26:41,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {484#true} ~cond := #in~cond; {484#true} is VALID [2022-04-15 10:26:41,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {484#true} assume !(0 == ~cond); {484#true} is VALID [2022-04-15 10:26:41,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {484#true} assume true; {484#true} is VALID [2022-04-15 10:26:41,130 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {484#true} {484#true} #59#return; {484#true} is VALID [2022-04-15 10:26:41,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {484#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {522#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 10:26:41,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {522#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {522#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 10:26:41,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {522#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 1);havoc #t~post6; {522#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 10:26:41,135 INFO L272 TraceCheckUtils]: 14: Hoare triple {522#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {532#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:26:41,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {532#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {536#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:26:41,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {536#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {485#false} is VALID [2022-04-15 10:26:41,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {485#false} assume !false; {485#false} is VALID [2022-04-15 10:26:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 10:26:41,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 10:26:41,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:26:41,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783597313] [2022-04-15 10:26:41,136 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:26:41,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896557711] [2022-04-15 10:26:41,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896557711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:26:41,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:26:41,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 10:26:41,137 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:26:41,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1396635402] [2022-04-15 10:26:41,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1396635402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:26:41,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:26:41,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 10:26:41,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729599148] [2022-04-15 10:26:41,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:26:41,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 10:26:41,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:26:41,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 10:26:41,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:26:41,151 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 10:26:41,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:26:41,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 10:26:41,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 10:26:41,151 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 10:26:41,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:26:41,275 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-15 10:26:41,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 10:26:41,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 10:26:41,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:26:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 10:26:41,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-15 10:26:41,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 10:26:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-15 10:26:41,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-04-15 10:26:41,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:26:41,315 INFO L225 Difference]: With dead ends: 38 [2022-04-15 10:26:41,315 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 10:26:41,316 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 10:26:41,316 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:26:41,317 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 75 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:26:41,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 10:26:41,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2022-04-15 10:26:41,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:26:41,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:26:41,333 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:26:41,333 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:26:41,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:26:41,334 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-15 10:26:41,335 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-15 10:26:41,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:26:41,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:26:41,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 36 states. [2022-04-15 10:26:41,335 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 36 states. [2022-04-15 10:26:41,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:26:41,337 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-15 10:26:41,337 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-15 10:26:41,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:26:41,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:26:41,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:26:41,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:26:41,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:26:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-15 10:26:41,338 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-15 10:26:41,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:26:41,339 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-15 10:26:41,339 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 10:26:41,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-15 10:26:41,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:26:41,364 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-15 10:26:41,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 10:26:41,364 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:26:41,364 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:26:41,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 10:26:41,579 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 10:26:41,579 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:26:41,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:26:41,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1094479982, now seen corresponding path program 1 times [2022-04-15 10:26:41,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:26:41,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [968204770] [2022-04-15 10:26:41,580 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:26:41,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1094479982, now seen corresponding path program 2 times [2022-04-15 10:26:41,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:26:41,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259684205] [2022-04-15 10:26:41,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:26:41,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:26:41,592 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:26:41,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1257483293] [2022-04-15 10:26:41,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:26:41,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:26:41,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:26:41,593 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:26:41,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 10:26:41,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:26:41,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:26:41,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 10:26:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:26:41,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:26:41,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {756#true} call ULTIMATE.init(); {756#true} is VALID [2022-04-15 10:26:41,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {756#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {756#true} is VALID [2022-04-15 10:26:41,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {756#true} assume true; {756#true} is VALID [2022-04-15 10:26:41,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {756#true} {756#true} #65#return; {756#true} is VALID [2022-04-15 10:26:41,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {756#true} call #t~ret7 := main(); {756#true} is VALID [2022-04-15 10:26:41,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {756#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {756#true} is VALID [2022-04-15 10:26:41,723 INFO L272 TraceCheckUtils]: 6: Hoare triple {756#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {756#true} is VALID [2022-04-15 10:26:41,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {756#true} ~cond := #in~cond; {782#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 10:26:41,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {782#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {786#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:26:41,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {786#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {786#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:26:41,724 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {786#(not (= |assume_abort_if_not_#in~cond| 0))} {756#true} #59#return; {793#(<= 1 main_~b~0)} is VALID [2022-04-15 10:26:41,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {793#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {797#(<= 1 main_~y~0)} is VALID [2022-04-15 10:26:41,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {797#(<= 1 main_~y~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {797#(<= 1 main_~y~0)} is VALID [2022-04-15 10:26:41,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {797#(<= 1 main_~y~0)} assume !!(#t~post6 < 1);havoc #t~post6; {797#(<= 1 main_~y~0)} is VALID [2022-04-15 10:26:41,726 INFO L272 TraceCheckUtils]: 14: Hoare triple {797#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {756#true} is VALID [2022-04-15 10:26:41,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {756#true} ~cond := #in~cond; {756#true} is VALID [2022-04-15 10:26:41,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {756#true} assume !(0 == ~cond); {756#true} is VALID [2022-04-15 10:26:41,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {756#true} assume true; {756#true} is VALID [2022-04-15 10:26:41,727 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {756#true} {797#(<= 1 main_~y~0)} #61#return; {797#(<= 1 main_~y~0)} is VALID [2022-04-15 10:26:41,727 INFO L290 TraceCheckUtils]: 19: Hoare triple {797#(<= 1 main_~y~0)} assume !(0 != ~y~0); {757#false} is VALID [2022-04-15 10:26:41,727 INFO L272 TraceCheckUtils]: 20: Hoare triple {757#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {757#false} is VALID [2022-04-15 10:26:41,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {757#false} ~cond := #in~cond; {757#false} is VALID [2022-04-15 10:26:41,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {757#false} assume 0 == ~cond; {757#false} is VALID [2022-04-15 10:26:41,728 INFO L290 TraceCheckUtils]: 23: Hoare triple {757#false} assume !false; {757#false} is VALID [2022-04-15 10:26:41,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 10:26:41,728 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 10:26:41,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:26:41,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259684205] [2022-04-15 10:26:41,728 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:26:41,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257483293] [2022-04-15 10:26:41,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257483293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:26:41,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:26:41,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 10:26:41,729 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:26:41,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [968204770] [2022-04-15 10:26:41,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [968204770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:26:41,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:26:41,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 10:26:41,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063677059] [2022-04-15 10:26:41,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:26:41,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-15 10:26:41,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:26:41,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 10:26:41,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:26:41,747 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 10:26:41,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:26:41,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 10:26:41,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 10:26:41,748 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 10:26:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:26:41,904 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-15 10:26:41,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 10:26:41,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-15 10:26:41,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:26:41,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 10:26:41,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-15 10:26:41,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 10:26:41,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-15 10:26:41,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-15 10:26:41,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:26:41,948 INFO L225 Difference]: With dead ends: 42 [2022-04-15 10:26:41,948 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 10:26:41,949 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 10:26:41,949 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:26:41,949 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 85 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:26:41,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 10:26:41,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-04-15 10:26:41,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:26:41,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:26:41,974 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:26:41,974 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:26:41,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:26:41,976 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-15 10:26:41,976 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 10:26:41,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:26:41,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:26:41,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-04-15 10:26:41,977 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-04-15 10:26:41,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:26:41,978 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-15 10:26:41,978 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 10:26:41,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:26:41,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:26:41,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:26:41,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:26:41,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:26:41,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-15 10:26:41,979 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 24 [2022-04-15 10:26:41,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:26:41,980 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-15 10:26:41,980 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 10:26:41,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 36 transitions. [2022-04-15 10:26:42,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:26:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-15 10:26:42,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 10:26:42,012 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:26:42,012 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:26:42,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 10:26:42,212 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:26:42,213 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:26:42,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:26:42,213 INFO L85 PathProgramCache]: Analyzing trace with hash 584619061, now seen corresponding path program 1 times [2022-04-15 10:26:42,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:26:42,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [697341557] [2022-04-15 10:26:43,785 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:26:43,785 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:26:43,785 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:26:43,785 INFO L85 PathProgramCache]: Analyzing trace with hash 584619061, now seen corresponding path program 2 times [2022-04-15 10:26:43,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:26:43,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555824203] [2022-04-15 10:26:43,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:26:43,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:26:43,811 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:26:43,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1987576881] [2022-04-15 10:26:43,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:26:43,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:26:43,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:26:43,812 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:26:43,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 10:26:43,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:26:43,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-15 10:26:43,851 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 10:26:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 10:26:43,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 10:26:43,871 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 10:26:43,871 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 10:26:43,873 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 10:26:43,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 10:26:44,087 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:26:44,089 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2] [2022-04-15 10:26:44,091 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 10:26:44,099 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 10:26:44,099 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 10:26:44,099 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 10:26:44,099 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 10:26:44,099 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 10:26:44,099 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 10:26:44,099 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 10:26:44,099 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 10:26:44,099 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 10:26:44,099 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 10:26:44,099 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 10:26:44,099 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-15 10:26:44,099 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-15 10:26:44,099 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-15 10:26:44,099 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-15 10:26:44,099 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 10:26:44,099 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 10:26:44,099 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 10:26:44,099 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 10:26:44,100 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-15 10:26:44,100 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-15 10:26:44,100 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-15 10:26:44,100 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-15 10:26:44,100 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-15 10:26:44,100 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 10:26:44,100 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-15 10:26:44,100 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-15 10:26:44,101 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 10:26:44,101 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 10:26:44,101 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-15 10:26:44,101 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-15 10:26:44,101 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-15 10:26:44,101 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-15 10:26:44,101 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 10:26:44,101 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 10:26:44,101 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-15 10:26:44,101 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-15 10:26:44,101 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-15 10:26:44,101 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-15 10:26:44,101 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-15 10:26:44,101 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 10:26:44,101 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-04-15 10:26:44,101 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 10:26:44,101 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 10:26:44,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 10:26:44 BoogieIcfgContainer [2022-04-15 10:26:44,102 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 10:26:44,103 INFO L158 Benchmark]: Toolchain (without parser) took 4937.64ms. Allocated memory was 205.5MB in the beginning and 316.7MB in the end (delta: 111.1MB). Free memory was 153.4MB in the beginning and 264.0MB in the end (delta: -110.6MB). Peak memory consumption was 315.7kB. Max. memory is 8.0GB. [2022-04-15 10:26:44,103 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 205.5MB. Free memory was 170.1MB in the beginning and 170.0MB in the end (delta: 90.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 10:26:44,103 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.61ms. Allocated memory was 205.5MB in the beginning and 316.7MB in the end (delta: 111.1MB). Free memory was 153.3MB in the beginning and 292.3MB in the end (delta: -139.0MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-04-15 10:26:44,103 INFO L158 Benchmark]: Boogie Preprocessor took 33.10ms. Allocated memory is still 316.7MB. Free memory was 292.3MB in the beginning and 290.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 10:26:44,104 INFO L158 Benchmark]: RCFGBuilder took 270.00ms. Allocated memory is still 316.7MB. Free memory was 290.8MB in the beginning and 279.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 10:26:44,104 INFO L158 Benchmark]: TraceAbstraction took 4396.99ms. Allocated memory is still 316.7MB. Free memory was 279.2MB in the beginning and 264.0MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-04-15 10:26:44,105 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 205.5MB. Free memory was 170.1MB in the beginning and 170.0MB in the end (delta: 90.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 233.61ms. Allocated memory was 205.5MB in the beginning and 316.7MB in the end (delta: 111.1MB). Free memory was 153.3MB in the beginning and 292.3MB in the end (delta: -139.0MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.10ms. Allocated memory is still 316.7MB. Free memory was 292.3MB in the beginning and 290.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 270.00ms. Allocated memory is still 316.7MB. Free memory was 290.8MB in the beginning and 279.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4396.99ms. Allocated memory is still 316.7MB. Free memory was 279.2MB in the beginning and 264.0MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L20] int counter = 0; [L22] int a, b; [L23] long long x, y, z; [L25] a = __VERIFIER_nondet_int() [L26] b = __VERIFIER_nondet_int() [L27] CALL assume_abort_if_not(b >= 1) [L10] COND FALSE !(!cond) [L27] RET assume_abort_if_not(b >= 1) [L29] x = a [L30] y = b [L31] z = 0 [L33] EXPR counter++ [L33] COND TRUE counter++<1 [L34] CALL __VERIFIER_assert(z + x * y == (long long) a * b) [L13] COND FALSE !(!(cond)) [L34] RET __VERIFIER_assert(z + x * y == (long long) a * b) [L35] COND FALSE !(!(y != 0)) [L38] COND FALSE !(y % 2 == 1) [L42] x = 2 * x [L43] y = y / 2 [L33] EXPR counter++ [L33] COND FALSE !(counter++<1) [L45] CALL __VERIFIER_assert(z == (long long) a * b) [L13] COND TRUE !(cond) [L15] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 261 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 161 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 102 IncrementalHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 100 mSDtfsCounter, 102 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=4, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-15 10:26:44,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...