/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 12:48:43,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 12:48:43,397 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 12:48:43,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 12:48:43,427 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 12:48:43,428 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 12:48:43,429 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 12:48:43,431 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 12:48:43,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 12:48:43,435 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 12:48:43,436 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 12:48:43,437 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 12:48:43,437 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 12:48:43,438 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 12:48:43,439 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 12:48:43,440 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 12:48:43,441 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 12:48:43,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 12:48:43,443 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 12:48:43,444 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 12:48:43,446 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 12:48:43,448 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 12:48:43,449 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 12:48:43,450 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 12:48:43,450 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 12:48:43,453 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 12:48:43,453 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 12:48:43,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 12:48:43,454 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 12:48:43,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 12:48:43,455 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 12:48:43,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 12:48:43,456 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 12:48:43,457 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 12:48:43,457 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 12:48:43,458 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 12:48:43,458 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 12:48:43,459 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 12:48:43,459 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 12:48:43,459 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 12:48:43,460 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 12:48:43,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 12:48:43,468 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 12:48:43,479 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 12:48:43,479 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 12:48:43,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 12:48:43,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 12:48:43,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 12:48:43,480 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 12:48:43,480 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 12:48:43,481 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 12:48:43,481 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 12:48:43,481 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 12:48:43,481 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 12:48:43,481 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 12:48:43,481 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 12:48:43,481 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 12:48:43,482 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 12:48:43,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:48:43,482 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 12:48:43,482 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 12:48:43,482 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 12:48:43,482 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 12:48:43,482 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 12:48:43,483 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 12:48:43,483 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-28 12:48:43,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 12:48:43,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 12:48:43,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 12:48:43,709 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 12:48:43,709 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 12:48:43,710 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound50.c [2022-04-28 12:48:43,771 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/927f9ca60/2b72cf89bc024182bc3daea84221b461/FLAGdc2e6e42c [2022-04-28 12:48:44,127 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 12:48:44,128 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound50.c [2022-04-28 12:48:44,133 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/927f9ca60/2b72cf89bc024182bc3daea84221b461/FLAGdc2e6e42c [2022-04-28 12:48:44,143 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/927f9ca60/2b72cf89bc024182bc3daea84221b461 [2022-04-28 12:48:44,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 12:48:44,146 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 12:48:44,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 12:48:44,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 12:48:44,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 12:48:44,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:48:44" (1/1) ... [2022-04-28 12:48:44,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a4b3068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:48:44, skipping insertion in model container [2022-04-28 12:48:44,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:48:44" (1/1) ... [2022-04-28 12:48:44,158 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 12:48:44,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 12:48:44,361 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/geo3-ll_unwindbound50.c[525,538] [2022-04-28 12:48:44,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:48:44,398 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 12:48:44,411 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/geo3-ll_unwindbound50.c[525,538] [2022-04-28 12:48:44,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:48:44,436 INFO L208 MainTranslator]: Completed translation [2022-04-28 12:48:44,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:48:44 WrapperNode [2022-04-28 12:48:44,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 12:48:44,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 12:48:44,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 12:48:44,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 12:48:44,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:48:44" (1/1) ... [2022-04-28 12:48:44,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:48:44" (1/1) ... [2022-04-28 12:48:44,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:48:44" (1/1) ... [2022-04-28 12:48:44,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:48:44" (1/1) ... [2022-04-28 12:48:44,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:48:44" (1/1) ... [2022-04-28 12:48:44,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:48:44" (1/1) ... [2022-04-28 12:48:44,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:48:44" (1/1) ... [2022-04-28 12:48:44,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 12:48:44,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 12:48:44,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 12:48:44,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 12:48:44,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:48:44" (1/1) ... [2022-04-28 12:48:44,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:48:44,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:48:44,518 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-28 12:48:44,541 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-28 12:48:44,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 12:48:44,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 12:48:44,566 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 12:48:44,566 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 12:48:44,566 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 12:48:44,566 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 12:48:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 12:48:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 12:48:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 12:48:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 12:48:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 12:48:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 12:48:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 12:48:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 12:48:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 12:48:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 12:48:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 12:48:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 12:48:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 12:48:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 12:48:44,614 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 12:48:44,615 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 12:48:44,723 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 12:48:44,728 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 12:48:44,728 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 12:48:44,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:48:44 BoogieIcfgContainer [2022-04-28 12:48:44,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 12:48:44,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 12:48:44,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 12:48:44,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 12:48:44,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 12:48:44" (1/3) ... [2022-04-28 12:48:44,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31622e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:48:44, skipping insertion in model container [2022-04-28 12:48:44,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:48:44" (2/3) ... [2022-04-28 12:48:44,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31622e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:48:44, skipping insertion in model container [2022-04-28 12:48:44,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:48:44" (3/3) ... [2022-04-28 12:48:44,735 INFO L111 eAbstractionObserver]: Analyzing ICFG geo3-ll_unwindbound50.c [2022-04-28 12:48:44,746 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 12:48:44,746 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 12:48:44,804 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 12:48:44,811 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@385705b9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@60f0b816 [2022-04-28 12:48:44,811 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 12:48:44,818 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 12:48:44,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 12:48:44,823 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:48:44,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:48:44,824 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:48:44,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:48:44,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 1 times [2022-04-28 12:48:44,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:48:44,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1694706194] [2022-04-28 12:48:44,844 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:48:44,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 2 times [2022-04-28 12:48:44,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:48:44,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626942234] [2022-04-28 12:48:44,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:48:44,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:48:44,925 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:48:44,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1116441247] [2022-04-28 12:48:44,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:48:44,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:48:44,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:48:44,928 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-28 12:48:44,929 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-28 12:48:44,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:48:44,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:48:44,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-28 12:48:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:48:45,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:48:45,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2022-04-28 12:48:45,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25#true} is VALID [2022-04-28 12:48:45,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 12:48:45,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-28 12:48:45,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret8 := main(); {25#true} is VALID [2022-04-28 12:48:45,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {25#true} is VALID [2022-04-28 12:48:45,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-28 12:48:45,062 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {26#false} is VALID [2022-04-28 12:48:45,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-28 12:48:45,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-28 12:48:45,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-28 12:48:45,064 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-28 12:48:45,064 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:48:45,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:48:45,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626942234] [2022-04-28 12:48:45,065 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:48:45,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116441247] [2022-04-28 12:48:45,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116441247] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:48:45,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:48:45,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 12:48:45,068 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:48:45,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1694706194] [2022-04-28 12:48:45,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1694706194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:48:45,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:48:45,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 12:48:45,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206546049] [2022-04-28 12:48:45,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:48:45,074 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 12:48:45,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:48:45,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 12:48:45,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:48:45,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-28 12:48:45,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:48:45,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-28 12:48:45,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-28 12:48:45,109 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 12:48:45,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:48:45,147 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 12:48:45,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-28 12:48:45,148 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 12:48:45,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:48:45,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 12:48:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2022-04-28 12:48:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 12:48:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2022-04-28 12:48:45,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 48 transitions. [2022-04-28 12:48:45,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:48:45,214 INFO L225 Difference]: With dead ends: 38 [2022-04-28 12:48:45,214 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 12:48:45,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-28 12:48:45,219 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:48:45,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:48:45,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 12:48:45,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 12:48:45,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:48:45,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:48:45,242 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:48:45,242 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:48:45,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:48:45,245 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 12:48:45,245 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 12:48:45,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:48:45,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:48:45,246 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-28 12:48:45,247 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-28 12:48:45,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:48:45,249 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 12:48:45,249 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 12:48:45,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:48:45,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:48:45,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:48:45,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:48:45,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:48:45,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 12:48:45,252 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-28 12:48:45,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:48:45,253 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 12:48:45,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 12:48:45,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 12:48:45,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:48:45,271 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 12:48:45,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 12:48:45,272 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:48:45,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:48:45,297 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-28 12:48:45,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-28 12:48:45,492 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:48:45,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:48:45,493 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 1 times [2022-04-28 12:48:45,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:48:45,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1869673252] [2022-04-28 12:48:45,494 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:48:45,494 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 2 times [2022-04-28 12:48:45,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:48:45,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198538906] [2022-04-28 12:48:45,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:48:45,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:48:45,512 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:48:45,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [993175770] [2022-04-28 12:48:45,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:48:45,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:48:45,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:48:45,514 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-28 12:48:45,515 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-28 12:48:45,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:48:45,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:48:45,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 12:48:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:48:45,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:48:45,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {203#true} call ULTIMATE.init(); {203#true} is VALID [2022-04-28 12:48:45,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {211#(<= ~counter~0 0)} is VALID [2022-04-28 12:48:45,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {211#(<= ~counter~0 0)} assume true; {211#(<= ~counter~0 0)} is VALID [2022-04-28 12:48:45,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {211#(<= ~counter~0 0)} {203#true} #54#return; {211#(<= ~counter~0 0)} is VALID [2022-04-28 12:48:45,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {211#(<= ~counter~0 0)} call #t~ret8 := main(); {211#(<= ~counter~0 0)} is VALID [2022-04-28 12:48:45,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {211#(<= ~counter~0 0)} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {211#(<= ~counter~0 0)} is VALID [2022-04-28 12:48:45,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {211#(<= ~counter~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {227#(<= |main_#t~post7| 0)} is VALID [2022-04-28 12:48:45,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {227#(<= |main_#t~post7| 0)} assume !(#t~post7 < 50);havoc #t~post7; {204#false} is VALID [2022-04-28 12:48:45,684 INFO L272 TraceCheckUtils]: 8: Hoare triple {204#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {204#false} is VALID [2022-04-28 12:48:45,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {204#false} ~cond := #in~cond; {204#false} is VALID [2022-04-28 12:48:45,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {204#false} assume 0 == ~cond; {204#false} is VALID [2022-04-28 12:48:45,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {204#false} assume !false; {204#false} is VALID [2022-04-28 12:48:45,684 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-28 12:48:45,685 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:48:45,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:48:45,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198538906] [2022-04-28 12:48:45,685 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:48:45,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993175770] [2022-04-28 12:48:45,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993175770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:48:45,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:48:45,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:48:45,686 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:48:45,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1869673252] [2022-04-28 12:48:45,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1869673252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:48:45,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:48:45,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:48:45,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732191784] [2022-04-28 12:48:45,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:48:45,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 12:48:45,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:48:45,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 12:48:45,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:48:45,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 12:48:45,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:48:45,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 12:48:45,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 12:48:45,703 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 12:48:45,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:48:45,764 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-28 12:48:45,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 12:48:45,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 12:48:45,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:48:45,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 12:48:45,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 12:48:45,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 12:48:45,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 12:48:45,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-28 12:48:45,804 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-28 12:48:45,806 INFO L225 Difference]: With dead ends: 26 [2022-04-28 12:48:45,807 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 12:48:45,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-28 12:48:45,813 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 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-28 12:48:45,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:48:45,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 12:48:45,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 12:48:45,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:48:45,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:48:45,826 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:48:45,827 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:48:45,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:48:45,830 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 12:48:45,830 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 12:48:45,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:48:45,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:48:45,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-28 12:48:45,832 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-28 12:48:45,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:48:45,835 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 12:48:45,836 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 12:48:45,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:48:45,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:48:45,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:48:45,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:48:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:48:45,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-28 12:48:45,839 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-28 12:48:45,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:48:45,840 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-28 12:48:45,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 12:48:45,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-28 12:48:45,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:48:45,859 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 12:48:45,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 12:48:45,860 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:48:45,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:48:45,885 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-28 12:48:46,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-28 12:48:46,083 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:48:46,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:48:46,083 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 1 times [2022-04-28 12:48:46,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:48:46,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [983788619] [2022-04-28 12:48:46,085 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:48:46,085 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 2 times [2022-04-28 12:48:46,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:48:46,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084352129] [2022-04-28 12:48:46,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:48:46,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:48:46,108 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:48:46,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [174263322] [2022-04-28 12:48:46,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:48:46,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:48:46,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:48:46,112 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-28 12:48:46,124 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-28 12:48:46,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:48:46,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:48:46,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 12:48:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:48:46,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:48:46,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {370#true} call ULTIMATE.init(); {370#true} is VALID [2022-04-28 12:48:46,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {370#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {370#true} is VALID [2022-04-28 12:48:46,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {370#true} assume true; {370#true} is VALID [2022-04-28 12:48:46,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {370#true} {370#true} #54#return; {370#true} is VALID [2022-04-28 12:48:46,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {370#true} call #t~ret8 := main(); {370#true} is VALID [2022-04-28 12:48:46,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {370#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {390#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 12:48:46,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {390#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 12:48:46,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(#t~post7 < 50);havoc #t~post7; {390#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 12:48:46,283 INFO L272 TraceCheckUtils]: 8: Hoare triple {390#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {400#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:48:46,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {400#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {404#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:48:46,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {404#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {371#false} is VALID [2022-04-28 12:48:46,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {371#false} assume !false; {371#false} is VALID [2022-04-28 12:48:46,284 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-28 12:48:46,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:48:46,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:48:46,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084352129] [2022-04-28 12:48:46,285 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:48:46,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174263322] [2022-04-28 12:48:46,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174263322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:48:46,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:48:46,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:48:46,286 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:48:46,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [983788619] [2022-04-28 12:48:46,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [983788619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:48:46,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:48:46,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:48:46,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811839472] [2022-04-28 12:48:46,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:48:46,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 12:48:46,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:48:46,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 12:48:46,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:48:46,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:48:46,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:48:46,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:48:46,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:48:46,300 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 12:48:46,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:48:46,401 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-28 12:48:46,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:48:46,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 12:48:46,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:48:46,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 12:48:46,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-28 12:48:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 12:48:46,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-28 12:48:46,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-28 12:48:46,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:48:46,435 INFO L225 Difference]: With dead ends: 28 [2022-04-28 12:48:46,435 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 12:48:46,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-28 12:48:46,436 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:48:46,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 57 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:48:46,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 12:48:46,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 12:48:46,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:48:46,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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-28 12:48:46,448 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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-28 12:48:46,448 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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-28 12:48:46,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:48:46,450 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 12:48:46,450 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 12:48:46,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:48:46,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:48:46,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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 25 states. [2022-04-28 12:48:46,451 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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 25 states. [2022-04-28 12:48:46,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:48:46,452 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 12:48:46,452 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 12:48:46,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:48:46,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:48:46,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:48:46,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:48:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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-28 12:48:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-28 12:48:46,454 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2022-04-28 12:48:46,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:48:46,455 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-28 12:48:46,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 12:48:46,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-28 12:48:46,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:48:46,479 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 12:48:46,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 12:48:46,480 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:48:46,480 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:48:46,507 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-28 12:48:46,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:48:46,694 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:48:46,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:48:46,695 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 1 times [2022-04-28 12:48:46,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:48:46,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [511171758] [2022-04-28 12:48:50,262 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 12:48:50,263 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 12:48:50,263 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 2 times [2022-04-28 12:48:50,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:48:50,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78133041] [2022-04-28 12:48:50,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:48:50,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:48:50,277 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:48:50,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [528839107] [2022-04-28 12:48:50,277 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:48:50,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:48:50,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:48:50,278 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-28 12:48:50,299 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-28 12:48:50,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:48:50,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:48:50,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:48:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:48:50,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:48:50,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2022-04-28 12:48:50,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {568#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {576#(<= ~counter~0 0)} is VALID [2022-04-28 12:48:50,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-28 12:48:50,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {576#(<= ~counter~0 0)} {568#true} #54#return; {576#(<= ~counter~0 0)} is VALID [2022-04-28 12:48:50,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {576#(<= ~counter~0 0)} call #t~ret8 := main(); {576#(<= ~counter~0 0)} is VALID [2022-04-28 12:48:50,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {576#(<= ~counter~0 0)} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {576#(<= ~counter~0 0)} is VALID [2022-04-28 12:48:50,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {576#(<= ~counter~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {592#(<= ~counter~0 1)} is VALID [2022-04-28 12:48:50,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {592#(<= ~counter~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {592#(<= ~counter~0 1)} is VALID [2022-04-28 12:48:50,490 INFO L272 TraceCheckUtils]: 8: Hoare triple {592#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {592#(<= ~counter~0 1)} is VALID [2022-04-28 12:48:50,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {592#(<= ~counter~0 1)} ~cond := #in~cond; {592#(<= ~counter~0 1)} is VALID [2022-04-28 12:48:50,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {592#(<= ~counter~0 1)} assume !(0 == ~cond); {592#(<= ~counter~0 1)} is VALID [2022-04-28 12:48:50,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {592#(<= ~counter~0 1)} assume true; {592#(<= ~counter~0 1)} is VALID [2022-04-28 12:48:50,492 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {592#(<= ~counter~0 1)} {592#(<= ~counter~0 1)} #50#return; {592#(<= ~counter~0 1)} is VALID [2022-04-28 12:48:50,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {592#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {592#(<= ~counter~0 1)} is VALID [2022-04-28 12:48:50,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {592#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {617#(<= |main_#t~post7| 1)} is VALID [2022-04-28 12:48:50,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {617#(<= |main_#t~post7| 1)} assume !(#t~post7 < 50);havoc #t~post7; {569#false} is VALID [2022-04-28 12:48:50,498 INFO L272 TraceCheckUtils]: 16: Hoare triple {569#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {569#false} is VALID [2022-04-28 12:48:50,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2022-04-28 12:48:50,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2022-04-28 12:48:50,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {569#false} assume !false; {569#false} is VALID [2022-04-28 12:48:50,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 12:48:50,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:48:50,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {569#false} assume !false; {569#false} is VALID [2022-04-28 12:48:50,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2022-04-28 12:48:50,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2022-04-28 12:48:50,653 INFO L272 TraceCheckUtils]: 16: Hoare triple {569#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {569#false} is VALID [2022-04-28 12:48:50,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {645#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {569#false} is VALID [2022-04-28 12:48:50,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {649#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {645#(< |main_#t~post7| 50)} is VALID [2022-04-28 12:48:50,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {649#(< ~counter~0 50)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {649#(< ~counter~0 50)} is VALID [2022-04-28 12:48:50,655 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {568#true} {649#(< ~counter~0 50)} #50#return; {649#(< ~counter~0 50)} is VALID [2022-04-28 12:48:50,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {568#true} assume true; {568#true} is VALID [2022-04-28 12:48:50,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {568#true} assume !(0 == ~cond); {568#true} is VALID [2022-04-28 12:48:50,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {568#true} ~cond := #in~cond; {568#true} is VALID [2022-04-28 12:48:50,655 INFO L272 TraceCheckUtils]: 8: Hoare triple {649#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {568#true} is VALID [2022-04-28 12:48:50,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {649#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {649#(< ~counter~0 50)} is VALID [2022-04-28 12:48:50,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {674#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {649#(< ~counter~0 50)} is VALID [2022-04-28 12:48:50,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {674#(< ~counter~0 49)} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {674#(< ~counter~0 49)} is VALID [2022-04-28 12:48:50,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {674#(< ~counter~0 49)} call #t~ret8 := main(); {674#(< ~counter~0 49)} is VALID [2022-04-28 12:48:50,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {674#(< ~counter~0 49)} {568#true} #54#return; {674#(< ~counter~0 49)} is VALID [2022-04-28 12:48:50,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {674#(< ~counter~0 49)} assume true; {674#(< ~counter~0 49)} is VALID [2022-04-28 12:48:50,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {568#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {674#(< ~counter~0 49)} is VALID [2022-04-28 12:48:50,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2022-04-28 12:48:50,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 12:48:50,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:48:50,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78133041] [2022-04-28 12:48:50,659 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:48:50,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528839107] [2022-04-28 12:48:50,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528839107] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:48:50,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:48:50,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 12:48:50,660 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:48:50,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [511171758] [2022-04-28 12:48:50,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [511171758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:48:50,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:48:50,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:48:50,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193827258] [2022-04-28 12:48:50,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:48:50,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 12:48:50,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:48:50,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:48:50,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:48:50,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:48:50,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:48:50,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:48:50,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 12:48:50,684 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:48:50,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:48:50,761 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 12:48:50,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 12:48:50,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 12:48:50,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:48:50,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:48:50,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 12:48:50,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:48:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 12:48:50,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-28 12:48:50,795 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-28 12:48:50,797 INFO L225 Difference]: With dead ends: 34 [2022-04-28 12:48:50,797 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 12:48:50,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:48:50,799 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:48:50,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:48:50,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 12:48:50,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 12:48:50,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:48:50,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-28 12:48:50,821 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-28 12:48:50,822 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-28 12:48:50,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:48:50,825 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 12:48:50,825 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 12:48:50,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:48:50,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:48:50,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-28 12:48:50,830 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-28 12:48:50,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:48:50,834 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 12:48:50,834 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 12:48:50,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:48:50,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:48:50,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:48:50,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:48:50,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-28 12:48:50,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-28 12:48:50,838 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2022-04-28 12:48:50,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:48:50,839 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-28 12:48:50,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:48:50,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-28 12:48:50,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:48:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 12:48:50,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 12:48:50,865 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:48:50,865 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:48:50,891 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-28 12:48:51,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:48:51,088 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:48:51,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:48:51,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 1 times [2022-04-28 12:48:51,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:48:51,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [589315577] [2022-04-28 12:48:53,223 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 12:48:53,223 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 12:48:53,224 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 2 times [2022-04-28 12:48:53,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:48:53,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528441353] [2022-04-28 12:48:53,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:48:53,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:48:53,239 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:48:53,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [156991606] [2022-04-28 12:48:53,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:48:53,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:48:53,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:48:53,252 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:48:53,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 12:48:53,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:48:53,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:48:53,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 12:48:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:48:53,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:48:53,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {873#true} call ULTIMATE.init(); {873#true} is VALID [2022-04-28 12:48:53,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {873#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {873#true} is VALID [2022-04-28 12:48:53,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {873#true} assume true; {873#true} is VALID [2022-04-28 12:48:53,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {873#true} {873#true} #54#return; {873#true} is VALID [2022-04-28 12:48:53,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {873#true} call #t~ret8 := main(); {873#true} is VALID [2022-04-28 12:48:53,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {873#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 12:48:53,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 12:48:53,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(#t~post7 < 50);havoc #t~post7; {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 12:48:53,669 INFO L272 TraceCheckUtils]: 8: Hoare triple {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {873#true} is VALID [2022-04-28 12:48:53,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {873#true} ~cond := #in~cond; {906#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:48:53,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {906#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {910#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:48:53,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {910#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {910#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:48:53,671 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {910#(not (= |__VERIFIER_assert_#in~cond| 0))} {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} #50#return; {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 12:48:53,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {920#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 12:48:53,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {920#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {920#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 12:48:53,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(#t~post7 < 50);havoc #t~post7; {920#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 12:48:53,694 INFO L272 TraceCheckUtils]: 16: Hoare triple {920#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:48:53,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:48:53,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {874#false} is VALID [2022-04-28 12:48:53,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {874#false} assume !false; {874#false} is VALID [2022-04-28 12:48:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 12:48:53,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:49:04,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {874#false} assume !false; {874#false} is VALID [2022-04-28 12:49:04,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {874#false} is VALID [2022-04-28 12:49:04,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:49:04,762 INFO L272 TraceCheckUtils]: 16: Hoare triple {950#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:49:04,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {950#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !!(#t~post7 < 50);havoc #t~post7; {950#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 12:49:04,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {950#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {950#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 12:49:04,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {960#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {950#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 12:49:04,797 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {910#(not (= |__VERIFIER_assert_#in~cond| 0))} {873#true} #50#return; {960#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-28 12:49:04,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {910#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {910#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:49:04,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {973#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {910#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:49:04,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {873#true} ~cond := #in~cond; {973#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:49:04,799 INFO L272 TraceCheckUtils]: 8: Hoare triple {873#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {873#true} is VALID [2022-04-28 12:49:04,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {873#true} assume !!(#t~post7 < 50);havoc #t~post7; {873#true} is VALID [2022-04-28 12:49:04,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {873#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {873#true} is VALID [2022-04-28 12:49:04,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {873#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {873#true} is VALID [2022-04-28 12:49:04,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {873#true} call #t~ret8 := main(); {873#true} is VALID [2022-04-28 12:49:04,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {873#true} {873#true} #54#return; {873#true} is VALID [2022-04-28 12:49:04,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {873#true} assume true; {873#true} is VALID [2022-04-28 12:49:04,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {873#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {873#true} is VALID [2022-04-28 12:49:04,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {873#true} call ULTIMATE.init(); {873#true} is VALID [2022-04-28 12:49:04,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 12:49:04,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:49:04,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528441353] [2022-04-28 12:49:04,800 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:49:04,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156991606] [2022-04-28 12:49:04,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156991606] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:49:04,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:49:04,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-28 12:49:04,801 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:49:04,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [589315577] [2022-04-28 12:49:04,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [589315577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:49:04,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:49:04,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:49:04,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230174212] [2022-04-28 12:49:04,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:49:04,802 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 12:49:04,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:49:04,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:49:04,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:49:04,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:49:04,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:49:04,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:49:04,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 12:49:04,867 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:49:05,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:49:05,843 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-28 12:49:05,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 12:49:05,843 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 12:49:05,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:49:05,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:49:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-04-28 12:49:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:49:05,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-04-28 12:49:05,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 36 transitions. [2022-04-28 12:49:06,026 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-28 12:49:06,027 INFO L225 Difference]: With dead ends: 36 [2022-04-28 12:49:06,027 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 12:49:06,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 12:49:06,028 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 12:49:06,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 79 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 12:49:06,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 12:49:06,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 12:49:06,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:49:06,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1363636363636365) 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), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 12:49:06,048 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1363636363636365) 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), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 12:49:06,048 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1363636363636365) 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), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 12:49:06,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:49:06,049 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 12:49:06,049 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 12:49:06,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:49:06,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:49:06,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.1363636363636365) 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), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-28 12:49:06,050 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.1363636363636365) 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), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-28 12:49:06,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:49:06,051 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 12:49:06,051 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 12:49:06,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:49:06,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:49:06,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:49:06,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:49:06,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.1363636363636365) 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), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 12:49:06,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-28 12:49:06,053 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 20 [2022-04-28 12:49:06,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:49:06,053 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-28 12:49:06,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:49:06,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-28 12:49:06,095 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-28 12:49:06,095 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 12:49:06,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 12:49:06,096 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:49:06,096 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:49:06,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 12:49:06,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:49:06,297 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:49:06,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:49:06,297 INFO L85 PathProgramCache]: Analyzing trace with hash -696181196, now seen corresponding path program 3 times [2022-04-28 12:49:06,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:49:06,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1748438947] [2022-04-28 12:49:10,369 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 12:49:10,369 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 12:49:10,370 INFO L85 PathProgramCache]: Analyzing trace with hash -696181196, now seen corresponding path program 4 times [2022-04-28 12:49:10,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:49:10,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838035919] [2022-04-28 12:49:10,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:49:10,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:49:10,406 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:49:10,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1635988497] [2022-04-28 12:49:10,406 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:49:10,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:49:10,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:49:10,412 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:49:10,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 12:49:10,840 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:49:10,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:49:10,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 12:49:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:49:11,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:49:27,528 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:49:37,548 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:49:47,739 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:49:56,094 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_main_~z~0 0)) (.cse0 (+ (* (- 1) c_main_~a~0) c_main_~x~0))) (or (and (= (mod .cse0 c_main_~z~0) 0) (let ((.cse1 (= c_main_~az~0 0)) (.cse2 (let ((.cse3 (div .cse0 c_main_~z~0))) (+ (* .cse3 c_main_~z~0) (* (- 1) .cse3) c_main_~a~0)))) (or (and (= (mod c_main_~y~0 c_main_~z~0) 0) .cse1 (= .cse2 0)) (and (= (* (div .cse2 c_main_~az~0) c_main_~z~0) c_main_~y~0) (not .cse1) (= (mod .cse2 c_main_~az~0) 0)))) (not .cse4)) (and (= c_main_~y~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ c_main_~a~0 (* v_main_~x~0_29 c_main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 c_main_~az~0)))) .cse4 (= 0 .cse0)))) is different from false [2022-04-28 12:50:53,862 WARN L232 SmtUtils]: Spent 12.16s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 12:51:10,092 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:51:18,238 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:51:23,365 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:51:27,580 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:52:15,677 WARN L232 SmtUtils]: Spent 22.81s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 12:52:57,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2022-04-28 12:52:57,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {1211#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1211#true} is VALID [2022-04-28 12:52:57,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 12:52:57,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1211#true} {1211#true} #54#return; {1211#true} is VALID [2022-04-28 12:52:57,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {1211#true} call #t~ret8 := main(); {1211#true} is VALID [2022-04-28 12:52:57,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {1211#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {1211#true} is VALID [2022-04-28 12:52:57,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {1211#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1211#true} is VALID [2022-04-28 12:52:57,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {1211#true} assume !!(#t~post7 < 50);havoc #t~post7; {1211#true} is VALID [2022-04-28 12:52:57,378 INFO L272 TraceCheckUtils]: 8: Hoare triple {1211#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1211#true} is VALID [2022-04-28 12:52:57,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {1211#true} ~cond := #in~cond; {1243#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:52:57,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {1243#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:52:57,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:52:57,393 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} {1211#true} #50#return; {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 12:52:59,395 WARN L290 TraceCheckUtils]: 13: Hoare triple {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1258#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} is UNKNOWN [2022-04-28 12:52:59,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {1258#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1258#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} is VALID [2022-04-28 12:52:59,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {1258#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} assume !!(#t~post7 < 50);havoc #t~post7; {1258#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} is VALID [2022-04-28 12:52:59,400 INFO L272 TraceCheckUtils]: 16: Hoare triple {1258#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1211#true} is VALID [2022-04-28 12:52:59,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {1211#true} ~cond := #in~cond; {1243#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:52:59,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {1243#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:52:59,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:52:59,404 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} {1258#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} #50#return; {1280#(and (or (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (or (and (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))))) (and (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0))) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)))} is VALID [2022-04-28 12:53:01,406 WARN L290 TraceCheckUtils]: 21: Hoare triple {1280#(and (or (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (or (and (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))))) (and (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0))) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1284#(or (and (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~a~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) (* main_~z~0 (div (+ (* (- 1) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0))) main_~az~0))) (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))))) (not (= main_~z~0 0))))} is UNKNOWN [2022-04-28 12:53:01,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {1284#(or (and (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~a~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) (* main_~z~0 (div (+ (* (- 1) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0))) main_~az~0))) (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))))) (not (= main_~z~0 0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1284#(or (and (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~a~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) (* main_~z~0 (div (+ (* (- 1) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0))) main_~az~0))) (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))))) (not (= main_~z~0 0))))} is VALID [2022-04-28 12:53:01,418 INFO L290 TraceCheckUtils]: 23: Hoare triple {1284#(or (and (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~a~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) (* main_~z~0 (div (+ (* (- 1) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0))) main_~az~0))) (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))))) (not (= main_~z~0 0))))} assume !(#t~post7 < 50);havoc #t~post7; {1284#(or (and (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~a~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) (* main_~z~0 (div (+ (* (- 1) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0))) main_~az~0))) (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))))) (not (= main_~z~0 0))))} is VALID [2022-04-28 12:53:01,468 INFO L272 TraceCheckUtils]: 24: Hoare triple {1284#(or (and (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~a~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) (* main_~z~0 (div (+ (* (- 1) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0))) main_~az~0))) (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))))) (not (= main_~z~0 0))))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:53:01,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1298#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:53:01,469 INFO L290 TraceCheckUtils]: 26: Hoare triple {1298#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1212#false} is VALID [2022-04-28 12:53:01,469 INFO L290 TraceCheckUtils]: 27: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2022-04-28 12:53:01,470 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-04-28 12:53:01,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:53:14,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2022-04-28 12:53:14,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {1298#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1212#false} is VALID [2022-04-28 12:53:14,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1298#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:53:14,690 INFO L272 TraceCheckUtils]: 24: Hoare triple {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:53:14,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !(#t~post7 < 50);havoc #t~post7; {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 12:53:14,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 12:53:14,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {1323#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 12:53:14,717 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} {1211#true} #50#return; {1323#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-28 12:53:14,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:53:14,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {1336#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:53:14,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {1211#true} ~cond := #in~cond; {1336#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:53:14,719 INFO L272 TraceCheckUtils]: 16: Hoare triple {1211#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1211#true} is VALID [2022-04-28 12:53:14,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {1211#true} assume !!(#t~post7 < 50);havoc #t~post7; {1211#true} is VALID [2022-04-28 12:53:14,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {1211#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1211#true} is VALID [2022-04-28 12:53:14,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {1211#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1211#true} is VALID [2022-04-28 12:53:14,719 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1211#true} {1211#true} #50#return; {1211#true} is VALID [2022-04-28 12:53:14,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 12:53:14,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-28 12:53:14,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-28 12:53:14,720 INFO L272 TraceCheckUtils]: 8: Hoare triple {1211#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1211#true} is VALID [2022-04-28 12:53:14,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {1211#true} assume !!(#t~post7 < 50);havoc #t~post7; {1211#true} is VALID [2022-04-28 12:53:14,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {1211#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1211#true} is VALID [2022-04-28 12:53:14,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {1211#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {1211#true} is VALID [2022-04-28 12:53:14,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {1211#true} call #t~ret8 := main(); {1211#true} is VALID [2022-04-28 12:53:14,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1211#true} {1211#true} #54#return; {1211#true} is VALID [2022-04-28 12:53:14,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 12:53:14,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {1211#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1211#true} is VALID [2022-04-28 12:53:14,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2022-04-28 12:53:14,721 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:53:14,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:53:14,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838035919] [2022-04-28 12:53:14,721 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:53:14,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635988497] [2022-04-28 12:53:14,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635988497] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:53:14,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:53:14,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2022-04-28 12:53:14,722 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:53:14,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1748438947] [2022-04-28 12:53:14,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1748438947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:53:14,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:53:14,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 12:53:14,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552352508] [2022-04-28 12:53:14,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:53:14,723 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 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 28 [2022-04-28 12:53:14,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:53:14,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 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-28 12:53:18,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 23 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 12:53:18,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 12:53:18,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:53:18,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 12:53:18,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=4, NotChecked=18, Total=132 [2022-04-28 12:53:18,848 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 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-28 12:53:42,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:53:42,808 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-28 12:53:42,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 12:53:42,808 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 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 28 [2022-04-28 12:53:42,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:53:42,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 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-28 12:53:42,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2022-04-28 12:53:42,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 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-28 12:53:42,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2022-04-28 12:53:42,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 34 transitions. [2022-04-28 12:53:46,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 32 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 12:53:46,928 INFO L225 Difference]: With dead ends: 40 [2022-04-28 12:53:46,929 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 12:53:46,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 59.8s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=4, NotChecked=22, Total=182 [2022-04-28 12:53:46,929 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 13 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:53:46,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 112 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 49 Unchecked, 0.0s Time] [2022-04-28 12:53:46,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 12:53:46,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 12:53:46,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:53:46,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 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-28 12:53:46,952 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 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-28 12:53:46,952 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 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-28 12:53:46,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:53:46,953 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-04-28 12:53:46,953 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-04-28 12:53:46,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:53:46,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:53:46,954 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 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 33 states. [2022-04-28 12:53:46,954 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 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 33 states. [2022-04-28 12:53:46,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:53:46,955 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-04-28 12:53:46,955 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-04-28 12:53:46,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:53:46,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:53:46,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:53:46,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:53:46,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 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-28 12:53:46,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-04-28 12:53:46,957 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2022-04-28 12:53:46,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:53:46,957 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-04-28 12:53:46,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 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-28 12:53:46,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 34 transitions. [2022-04-28 12:53:53,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 31 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 12:53:53,023 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-04-28 12:53:53,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 12:53:53,023 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:53:53,023 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:53:53,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 12:53:53,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:53:53,224 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:53:53,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:53:53,225 INFO L85 PathProgramCache]: Analyzing trace with hash -694393736, now seen corresponding path program 3 times [2022-04-28 12:53:53,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:53:53,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1463189839] [2022-04-28 12:53:53,293 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 12:53:53,293 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 12:53:53,293 INFO L85 PathProgramCache]: Analyzing trace with hash -694393736, now seen corresponding path program 4 times [2022-04-28 12:53:53,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:53:53,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55946156] [2022-04-28 12:53:53,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:53:53,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:53:53,305 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:53:53,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1034585756] [2022-04-28 12:53:53,306 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:53:53,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:53:53,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:53:53,307 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:53:53,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 12:53:53,736 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:53:53,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:53:53,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 12:53:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:53:54,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:54:03,075 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:54:08,981 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:54:14,996 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:54:32,098 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:54:36,135 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:54:37,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {1608#true} call ULTIMATE.init(); {1608#true} is VALID [2022-04-28 12:54:37,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {1608#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1608#true} is VALID [2022-04-28 12:54:37,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {1608#true} assume true; {1608#true} is VALID [2022-04-28 12:54:37,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1608#true} {1608#true} #54#return; {1608#true} is VALID [2022-04-28 12:54:37,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {1608#true} call #t~ret8 := main(); {1608#true} is VALID [2022-04-28 12:54:37,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {1608#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {1608#true} is VALID [2022-04-28 12:54:37,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {1608#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1608#true} is VALID [2022-04-28 12:54:37,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {1608#true} assume !!(#t~post7 < 50);havoc #t~post7; {1608#true} is VALID [2022-04-28 12:54:37,162 INFO L272 TraceCheckUtils]: 8: Hoare triple {1608#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1608#true} is VALID [2022-04-28 12:54:37,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {1608#true} ~cond := #in~cond; {1640#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:54:37,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {1640#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1644#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:54:37,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {1644#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1644#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:54:37,164 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1644#(not (= |__VERIFIER_assert_#in~cond| 0))} {1608#true} #50#return; {1651#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 12:54:39,166 WARN L290 TraceCheckUtils]: 13: Hoare triple {1651#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1655#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} is UNKNOWN [2022-04-28 12:54:39,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {1655#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1655#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} is VALID [2022-04-28 12:54:39,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {1655#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {1655#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} is VALID [2022-04-28 12:54:39,168 INFO L272 TraceCheckUtils]: 16: Hoare triple {1655#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1608#true} is VALID [2022-04-28 12:54:39,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {1608#true} ~cond := #in~cond; {1640#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:54:39,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {1640#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1644#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:54:39,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {1644#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1644#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:54:39,170 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1644#(not (= |__VERIFIER_assert_#in~cond| 0))} {1655#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} #50#return; {1655#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} is VALID [2022-04-28 12:54:41,172 WARN L290 TraceCheckUtils]: 21: Hoare triple {1655#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1680#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= (mod (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0) 0) (= (+ (* (div (div main_~y~0 main_~z~0) main_~z~0) main_~az~0) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) (+ main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0))))} is UNKNOWN [2022-04-28 12:54:41,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {1680#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= (mod (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0) 0) (= (+ (* (div (div main_~y~0 main_~z~0) main_~z~0) main_~az~0) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) (+ main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1680#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= (mod (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0) 0) (= (+ (* (div (div main_~y~0 main_~z~0) main_~z~0) main_~az~0) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) (+ main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0))))} is VALID [2022-04-28 12:54:41,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {1680#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= (mod (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0) 0) (= (+ (* (div (div main_~y~0 main_~z~0) main_~z~0) main_~az~0) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) (+ main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0))))} assume !!(#t~post7 < 50);havoc #t~post7; {1680#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= (mod (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0) 0) (= (+ (* (div (div main_~y~0 main_~z~0) main_~z~0) main_~az~0) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) (+ main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0))))} is VALID [2022-04-28 12:54:41,213 INFO L272 TraceCheckUtils]: 24: Hoare triple {1680#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= (mod (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0) 0) (= (+ (* (div (div main_~y~0 main_~z~0) main_~z~0) main_~az~0) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) (+ main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0))))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1690#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:54:41,214 INFO L290 TraceCheckUtils]: 25: Hoare triple {1690#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1694#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:54:41,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {1694#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1609#false} is VALID [2022-04-28 12:54:41,214 INFO L290 TraceCheckUtils]: 27: Hoare triple {1609#false} assume !false; {1609#false} is VALID [2022-04-28 12:54:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:54:41,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:54:52,422 INFO L290 TraceCheckUtils]: 27: Hoare triple {1609#false} assume !false; {1609#false} is VALID [2022-04-28 12:54:52,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {1694#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1609#false} is VALID [2022-04-28 12:54:52,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {1690#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1694#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:54:52,438 INFO L272 TraceCheckUtils]: 24: Hoare triple {1651#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1690#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:54:52,438 INFO L290 TraceCheckUtils]: 23: Hoare triple {1651#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !!(#t~post7 < 50);havoc #t~post7; {1651#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 12:54:52,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {1651#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1651#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 12:54:52,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {1719#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1651#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 12:54:52,513 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1644#(not (= |__VERIFIER_assert_#in~cond| 0))} {1608#true} #50#return; {1719#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-28 12:54:52,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {1644#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1644#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:54:52,513 INFO L290 TraceCheckUtils]: 18: Hoare triple {1732#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1644#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:54:52,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {1608#true} ~cond := #in~cond; {1732#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:54:52,514 INFO L272 TraceCheckUtils]: 16: Hoare triple {1608#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1608#true} is VALID [2022-04-28 12:54:52,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {1608#true} assume !!(#t~post7 < 50);havoc #t~post7; {1608#true} is VALID [2022-04-28 12:54:52,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {1608#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1608#true} is VALID [2022-04-28 12:54:52,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {1608#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1608#true} is VALID [2022-04-28 12:54:52,514 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1608#true} {1608#true} #50#return; {1608#true} is VALID [2022-04-28 12:54:52,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {1608#true} assume true; {1608#true} is VALID [2022-04-28 12:54:52,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {1608#true} assume !(0 == ~cond); {1608#true} is VALID [2022-04-28 12:54:52,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {1608#true} ~cond := #in~cond; {1608#true} is VALID [2022-04-28 12:54:52,514 INFO L272 TraceCheckUtils]: 8: Hoare triple {1608#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1608#true} is VALID [2022-04-28 12:54:52,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {1608#true} assume !!(#t~post7 < 50);havoc #t~post7; {1608#true} is VALID [2022-04-28 12:54:52,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {1608#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1608#true} is VALID [2022-04-28 12:54:52,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {1608#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {1608#true} is VALID [2022-04-28 12:54:52,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {1608#true} call #t~ret8 := main(); {1608#true} is VALID [2022-04-28 12:54:52,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1608#true} {1608#true} #54#return; {1608#true} is VALID [2022-04-28 12:54:52,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {1608#true} assume true; {1608#true} is VALID [2022-04-28 12:54:52,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {1608#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1608#true} is VALID [2022-04-28 12:54:52,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {1608#true} call ULTIMATE.init(); {1608#true} is VALID [2022-04-28 12:54:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:54:52,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:54:52,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55946156] [2022-04-28 12:54:52,515 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:54:52,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034585756] [2022-04-28 12:54:52,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034585756] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:54:52,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:54:52,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-04-28 12:54:52,516 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:54:52,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1463189839] [2022-04-28 12:54:52,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1463189839] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:54:52,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:54:52,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 12:54:52,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393780094] [2022-04-28 12:54:52,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:54:52,517 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 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 28 [2022-04-28 12:54:52,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:54:52,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 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-28 12:54:56,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 23 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 12:54:56,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 12:54:56,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:54:56,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 12:54:56,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-28 12:54:56,586 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 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-28 12:54:58,799 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 12:55:01,608 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 12:55:02,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:02,438 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-04-28 12:55:02,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 12:55:02,438 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 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 28 [2022-04-28 12:55:02,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:55:02,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 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-28 12:55:02,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-28 12:55:02,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 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-28 12:55:02,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-28 12:55:02,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 28 transitions. [2022-04-28 12:55:08,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 25 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 12:55:08,683 INFO L225 Difference]: With dead ends: 33 [2022-04-28 12:55:08,683 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 12:55:08,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 12:55:08,684 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:55:08,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 88 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 2 Unknown, 0 Unchecked, 5.1s Time] [2022-04-28 12:55:08,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 12:55:08,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 12:55:08,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:55:08,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 12:55:08,685 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 12:55:08,685 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 12:55:08,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:08,685 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 12:55:08,685 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 12:55:08,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:55:08,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:55:08,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 12:55:08,685 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 12:55:08,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:08,686 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 12:55:08,686 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 12:55:08,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:55:08,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:55:08,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:55:08,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:55:08,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 12:55:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 12:55:08,686 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-28 12:55:08,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:55:08,686 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 12:55:08,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 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-28 12:55:08,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 12:55:08,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:55:08,687 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 12:55:08,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:55:08,689 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 12:55:08,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 12:55:08,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:55:08,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 12:55:36,875 WARN L232 SmtUtils]: Spent 27.93s on a formula simplification. DAG size of input: 101 DAG size of output: 75 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 12:56:05,485 WARN L232 SmtUtils]: Spent 28.60s on a formula simplification. DAG size of input: 100 DAG size of output: 74 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 12:56:46,592 WARN L232 SmtUtils]: Spent 41.09s on a formula simplification. DAG size of input: 102 DAG size of output: 72 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 12:59:11,783 WARN L232 SmtUtils]: Spent 2.42m on a formula simplification. DAG size of input: 90 DAG size of output: 69 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 13:00:33,559 WARN L232 SmtUtils]: Spent 1.36m on a formula simplification. DAG size of input: 86 DAG size of output: 65 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 13:00:33,593 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-28 13:00:33,593 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-28 13:00:33,593 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-28 13:00:33,593 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 11 13) no Hoare annotation was computed. [2022-04-28 13:00:33,593 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-28 13:00:33,593 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-28 13:00:33,593 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-28 13:00:33,594 INFO L895 garLoopResultBuilder]: At program point L34-1(lines 34 43) the Hoare annotation is: (let ((.cse12 (* main_~a~0 main_~z~0))) (let ((.cse10 (= main_~x~0 (+ .cse12 main_~a~0))) (.cse0 (= .cse12 main_~az~0))) (or (and (<= ~counter~0 1) (= main_~y~0 1) (<= |main_#t~post7| 0) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) .cse0) (let ((.cse11 (* (- 1) main_~a~0))) (let ((.cse6 (+ .cse11 main_~x~0))) (let ((.cse4 (div .cse6 main_~z~0))) (let ((.cse8 (+ .cse4 .cse11))) (let ((.cse2 (div .cse8 main_~z~0))) (let ((.cse3 (* main_~z~0 .cse2)) (.cse5 (= main_~y~0 0))) (and (or (= main_~az~0 0) (let ((.cse1 (div (+ (* (- 1) .cse4) main_~a~0 (* .cse4 main_~z~0)) main_~az~0))) (and (= .cse1 (* main_~z~0 (div (+ (* (- 1) .cse2) main_~a~0 .cse3) main_~az~0))) (= (* .cse1 main_~z~0) main_~y~0))) .cse5) (let ((.cse9 (= main_~z~0 0))) (or (let ((.cse7 (div main_~y~0 main_~z~0))) (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod .cse6 main_~z~0)) (= (mod .cse7 main_~z~0) 0) (= (mod .cse8 main_~z~0) 0) (= (+ (* (div .cse7 main_~z~0) main_~az~0) .cse2) (+ main_~a~0 .cse3)) (not .cse9))) (and .cse9 .cse5 .cse10)))))))))) (not (<= |old(~counter~0)| 0)) (and (<= |main_#t~post7| 1) (= main_~z~0 main_~y~0) .cse10 .cse0)))) [2022-04-28 13:00:33,594 INFO L895 garLoopResultBuilder]: At program point L34-3(lines 34 43) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~z~0))) (let ((.cse11 (= .cse0 main_~az~0))) (or (let ((.cse10 (* (- 1) main_~a~0))) (let ((.cse2 (+ .cse10 main_~x~0))) (let ((.cse7 (div .cse2 main_~z~0))) (let ((.cse4 (div (+ .cse7 .cse10) main_~z~0))) (let ((.cse9 (div main_~y~0 main_~z~0)) (.cse5 (* main_~z~0 .cse4)) (.cse1 (= main_~y~0 0))) (and (or (and (= .cse0 0) .cse1 (= main_~a~0 main_~x~0)) (and (= 0 (mod .cse2 main_~z~0)) (not (= main_~z~0 0)) (let ((.cse8 (* .cse7 main_~z~0))) (or (let ((.cse6 (+ (* (- 1) .cse7) main_~a~0 .cse8))) (let ((.cse3 (div .cse6 main_~az~0))) (and (= .cse3 (* main_~z~0 (div (+ (* (- 1) .cse4) main_~a~0 .cse5) main_~az~0))) (= (mod .cse6 main_~az~0) 0) (not (= main_~az~0 0)) (= (* .cse3 main_~z~0) main_~y~0)))) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod .cse9 main_~z~0) 0) (= .cse7 (+ main_~a~0 .cse8))))))) (or (= (+ (* (div .cse9 main_~z~0) main_~az~0) .cse4) (+ main_~a~0 .cse5)) .cse1))))))) (not (<= |old(~counter~0)| 0)) (and (= main_~y~0 1) (<= ~counter~0 0) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) .cse11) (and (= main_~z~0 main_~y~0) (<= ~counter~0 1) (= main_~x~0 (+ .cse0 main_~a~0)) .cse11)))) [2022-04-28 13:00:33,594 INFO L895 garLoopResultBuilder]: At program point L34-4(lines 34 43) the Hoare annotation is: (let ((.cse12 (* (- 1) main_~a~0))) (let ((.cse5 (+ .cse12 main_~x~0))) (let ((.cse10 (div .cse5 main_~z~0))) (let ((.cse11 (* .cse10 main_~z~0))) (let ((.cse6 (+ (* (- 1) .cse10) main_~a~0 .cse11))) (let ((.cse2 (div .cse6 main_~az~0)) (.cse3 (div (+ .cse10 .cse12) main_~z~0)) (.cse1 (* main_~a~0 main_~z~0))) (let ((.cse0 (= .cse1 main_~az~0)) (.cse4 (* main_~z~0 .cse3)) (.cse8 (not (= main_~z~0 0))) (.cse7 (= (* .cse2 main_~z~0) main_~y~0))) (or (and (= main_~y~0 1) (= main_~a~0 main_~x~0) .cse0) (not (<= |old(~counter~0)| 0)) (and (= main_~z~0 main_~y~0) (= main_~x~0 (+ .cse1 main_~a~0)) .cse0) (and (= .cse2 (* main_~z~0 (div (+ (* (- 1) .cse3) main_~a~0 .cse4) main_~az~0))) (= 0 (mod .cse5 main_~z~0)) (= (mod .cse6 main_~az~0) 0) (not (= main_~az~0 0)) .cse7 .cse8) (and (or (let ((.cse9 (div main_~y~0 main_~z~0))) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod .cse9 main_~z~0) 0) (= (+ (* (div .cse9 main_~z~0) main_~az~0) .cse3) (+ main_~a~0 .cse4)) .cse8)) (= main_~y~0 0)) (or (= .cse10 (+ main_~a~0 .cse11)) .cse7) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))))))))))) [2022-04-28 13:00:33,594 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 22 46) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (<= ~counter~0 0)) [2022-04-28 13:00:33,594 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 22 46) the Hoare annotation is: true [2022-04-28 13:00:33,594 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 22 46) the Hoare annotation is: true [2022-04-28 13:00:33,594 INFO L902 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: true [2022-04-28 13:00:33,595 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~z~0))) (let ((.cse11 (= .cse0 main_~az~0))) (or (let ((.cse10 (* (- 1) main_~a~0))) (let ((.cse2 (+ .cse10 main_~x~0))) (let ((.cse7 (div .cse2 main_~z~0))) (let ((.cse4 (div (+ .cse7 .cse10) main_~z~0))) (let ((.cse9 (div main_~y~0 main_~z~0)) (.cse5 (* main_~z~0 .cse4)) (.cse1 (= main_~y~0 0))) (and (or (and (= .cse0 0) .cse1 (= main_~a~0 main_~x~0)) (and (= 0 (mod .cse2 main_~z~0)) (not (= main_~z~0 0)) (let ((.cse8 (* .cse7 main_~z~0))) (or (let ((.cse6 (+ (* (- 1) .cse7) main_~a~0 .cse8))) (let ((.cse3 (div .cse6 main_~az~0))) (and (= .cse3 (* main_~z~0 (div (+ (* (- 1) .cse4) main_~a~0 .cse5) main_~az~0))) (= (mod .cse6 main_~az~0) 0) (not (= main_~az~0 0)) (= (* .cse3 main_~z~0) main_~y~0)))) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod .cse9 main_~z~0) 0) (= .cse7 (+ main_~a~0 .cse8))))))) (or (= (+ (* (div .cse9 main_~z~0) main_~az~0) .cse4) (+ main_~a~0 .cse5)) .cse1))))))) (not (<= |old(~counter~0)| 0)) (and (= main_~z~0 main_~y~0) (= main_~x~0 (+ .cse0 main_~a~0)) .cse11) (and (<= ~counter~0 1) (= main_~y~0 1) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) .cse11)))) [2022-04-28 13:00:33,595 INFO L895 garLoopResultBuilder]: At program point L35-1(lines 34 43) the Hoare annotation is: (let ((.cse7 (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))) (.cse8 (= (* main_~a~0 main_~z~0) main_~az~0))) (or (let ((.cse6 (* (- 1) main_~a~0))) (let ((.cse1 (div (+ .cse6 main_~x~0) main_~z~0)) (.cse0 (= main_~y~0 0))) (and (or (and .cse0 (= main_~a~0 main_~x~0)) (and (let ((.cse2 (* .cse1 main_~z~0))) (or (and (= (mod main_~y~0 main_~z~0) 0) (= .cse1 (+ main_~a~0 .cse2))) (and (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) .cse1) main_~a~0 .cse2) main_~az~0) main_~z~0) main_~y~0)))) (not (= main_~z~0 0)))) (or (let ((.cse3 (div main_~y~0 main_~z~0)) (.cse4 (+ .cse1 .cse6))) (and (= (mod .cse3 main_~z~0) 0) (= (mod .cse4 main_~z~0) 0) (let ((.cse5 (div .cse4 main_~z~0))) (= (+ (* (div .cse3 main_~z~0) main_~az~0) .cse5) (+ main_~a~0 (* main_~z~0 .cse5)))))) .cse0) .cse7))) (not (<= |old(~counter~0)| 0)) (and (= main_~z~0 main_~y~0) .cse7 .cse8) (and (<= ~counter~0 1) (= main_~y~0 1) .cse7 .cse8))) [2022-04-28 13:00:33,595 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-28 13:00:33,595 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-28 13:00:33,595 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-28 13:00:33,595 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 13:00:33,595 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-28 13:00:33,595 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 13:00:33,595 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 13:00:33,595 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 13:00:33,595 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 13:00:33,595 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-28 13:00:33,596 INFO L895 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 13:00:33,596 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 13:00:33,596 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 13:00:33,598 INFO L356 BasicCegarLoop]: Path program histogram: [4, 4, 2, 2, 2] [2022-04-28 13:00:33,600 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 13:00:33,602 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 13:00:33,603 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 13:00:33,605 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 13:00:33,607 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 13:00:33,607 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 13:00:34,225 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-28 13:00:39,242 INFO L163 areAnnotationChecker]: CFG has 26 edges. 24 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 13:00:39,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 01:00:39 BoogieIcfgContainer [2022-04-28 13:00:39,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 13:00:39,261 INFO L158 Benchmark]: Toolchain (without parser) took 715114.95ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 129.0MB in the beginning and 191.6MB in the end (delta: -62.7MB). Peak memory consumption was 96.1MB. Max. memory is 8.0GB. [2022-04-28 13:00:39,261 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 177.2MB. Free memory was 145.2MB in the beginning and 145.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 13:00:39,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.86ms. Allocated memory is still 177.2MB. Free memory was 128.7MB in the beginning and 155.8MB in the end (delta: -27.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-28 13:00:39,262 INFO L158 Benchmark]: Boogie Preprocessor took 47.22ms. Allocated memory is still 177.2MB. Free memory was 155.8MB in the beginning and 154.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 13:00:39,262 INFO L158 Benchmark]: RCFGBuilder took 243.81ms. Allocated memory is still 177.2MB. Free memory was 154.1MB in the beginning and 142.9MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 13:00:39,262 INFO L158 Benchmark]: TraceAbstraction took 714529.48ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 142.5MB in the beginning and 191.6MB in the end (delta: -49.1MB). Peak memory consumption was 108.7MB. Max. memory is 8.0GB. [2022-04-28 13:00:39,264 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.16ms. Allocated memory is still 177.2MB. Free memory was 145.2MB in the beginning and 145.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 289.86ms. Allocated memory is still 177.2MB. Free memory was 128.7MB in the beginning and 155.8MB in the end (delta: -27.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.22ms. Allocated memory is still 177.2MB. Free memory was 155.8MB in the beginning and 154.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 243.81ms. Allocated memory is still 177.2MB. Free memory was 154.1MB in the beginning and 142.9MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 714529.48ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 142.5MB in the beginning and 191.6MB in the end (delta: -49.1MB). Peak memory consumption was 108.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 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 708.8s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 41.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 324.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 47 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 456 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 49 IncrementalHoareTripleChecker+Unchecked, 327 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 177 IncrementalHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 129 mSDtfsCounter, 177 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 177 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 60.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=5, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 82 PreInvPairs, 133 NumberOfFragments, 1297 HoareAnnotationTreeSize, 82 FomulaSimplifications, 27 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 1312 FormulaSimplificationTreeSizeReductionInter, 324.6s HoareSimplificationTimeInter, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((a * z == 0 && y == 0) && a == x) || ((0 == (-1 * a + x) % z && !(z == 0)) && (((((-1 * ((-1 * a + x) / z) + a + (-1 * a + x) / z * z) / az == z * ((-1 * (((-1 * a + x) / z + -1 * a) / z) + a + z * (((-1 * a + x) / z + -1 * a) / z)) / az) && (-1 * ((-1 * a + x) / z) + a + (-1 * a + x) / z * z) % az == 0) && !(az == 0)) && (-1 * ((-1 * a + x) / z) + a + (-1 * a + x) / z * z) / az * z == y) || ((y % z == 0 && y / z % z == 0) && (-1 * a + x) / z == a + (-1 * a + x) / z * z)))) && (y / z / z * az + ((-1 * a + x) / z + -1 * a) / z == a + z * (((-1 * a + x) / z + -1 * a) / z) || y == 0)) || !(\old(counter) <= 0)) || (((y == 1 && counter <= 0) && y * az + x == z * x + a) && a * z == az)) || (((z == y && counter <= 1) && x == a * z + a) && a * z == az) - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-28 13:00:39,378 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...