/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/cohendiv-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 10:41:50,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:41:50,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:41:50,645 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:41:50,645 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:41:50,646 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:41:50,647 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:41:50,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:41:50,649 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:41:50,649 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:41:50,650 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:41:50,650 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:41:50,651 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:41:50,651 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:41:50,652 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:41:50,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:41:50,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:41:50,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:41:50,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:41:50,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:41:50,656 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:41:50,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:41:50,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:41:50,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:41:50,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:41:50,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:41:50,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:41:50,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:41:50,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:41:50,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:41:50,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:41:50,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:41:50,664 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:41:50,665 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:41:50,665 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:41:50,666 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:41:50,666 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:41:50,666 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:41:50,667 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:41:50,667 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:41:50,667 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:41:50,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:41:50,678 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 10:41:50,688 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:41:50,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:41:50,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:41:50,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:41:50,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:41:50,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:41:50,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:41:50,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:41:50,690 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:41:50,690 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:41:50,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:41:50,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:41:50,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:41:50,691 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:41:50,691 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:41:50,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:41:50,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:41:50,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:41:50,691 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:41:50,691 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:41:50,691 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:41:50,692 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:41:50,692 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-08 10:41:50,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:41:50,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:41:50,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:41:50,868 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:41:50,868 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:41:50,869 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/cohendiv-ll.c [2022-04-08 10:41:50,911 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa06a6610/9b8d03a8beed4aef801fc25d02f550f7/FLAGc775b9c5e [2022-04-08 10:41:51,251 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:41:51,252 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/cohendiv-ll.c [2022-04-08 10:41:51,256 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa06a6610/9b8d03a8beed4aef801fc25d02f550f7/FLAGc775b9c5e [2022-04-08 10:41:51,264 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa06a6610/9b8d03a8beed4aef801fc25d02f550f7 [2022-04-08 10:41:51,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:41:51,266 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:41:51,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:41:51,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:41:51,270 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:41:51,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:41:51" (1/1) ... [2022-04-08 10:41:51,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@487803b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:41:51, skipping insertion in model container [2022-04-08 10:41:51,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:41:51" (1/1) ... [2022-04-08 10:41:51,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:41:51,285 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:41:51,406 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/cohendiv-ll.c[576,589] [2022-04-08 10:41:51,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:41:51,429 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:41:51,437 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/cohendiv-ll.c[576,589] [2022-04-08 10:41:51,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:41:51,451 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:41:51,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:41:51 WrapperNode [2022-04-08 10:41:51,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:41:51,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:41:51,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:41:51,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:41:51,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:41:51" (1/1) ... [2022-04-08 10:41:51,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:41:51" (1/1) ... [2022-04-08 10:41:51,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:41:51" (1/1) ... [2022-04-08 10:41:51,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:41:51" (1/1) ... [2022-04-08 10:41:51,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:41:51" (1/1) ... [2022-04-08 10:41:51,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:41:51" (1/1) ... [2022-04-08 10:41:51,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:41:51" (1/1) ... [2022-04-08 10:41:51,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:41:51,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:41:51,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:41:51,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:41:51,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:41:51" (1/1) ... [2022-04-08 10:41:51,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:41:51,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:41:51,512 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-08 10:41:51,516 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-08 10:41:51,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:41:51,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:41:51,542 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:41:51,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 10:41:51,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 10:41:51,542 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:41:51,542 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 10:41:51,542 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:41:51,543 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:41:51,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:41:51,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 10:41:51,543 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 10:41:51,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 10:41:51,543 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:41:51,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:41:51,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:41:51,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:41:51,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:41:51,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:41:51,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:41:51,582 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:41:51,583 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:41:51,714 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:41:51,721 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:41:51,722 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 10:41:51,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:41:51 BoogieIcfgContainer [2022-04-08 10:41:51,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:41:51,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:41:51,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:41:51,738 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:41:51,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:41:51" (1/3) ... [2022-04-08 10:41:51,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd53ccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:41:51, skipping insertion in model container [2022-04-08 10:41:51,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:41:51" (2/3) ... [2022-04-08 10:41:51,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd53ccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:41:51, skipping insertion in model container [2022-04-08 10:41:51,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:41:51" (3/3) ... [2022-04-08 10:41:51,743 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll.c [2022-04-08 10:41:51,746 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:41:51,747 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:41:51,773 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:41:51,780 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 10:41:51,780 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:41:51,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 10:41:51,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 10:41:51,799 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:41:51,805 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:41:51,806 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:41:51,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:41:51,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1389800432, now seen corresponding path program 1 times [2022-04-08 10:41:51,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:41:51,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1325084952] [2022-04-08 10:41:51,827 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:41:51,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1389800432, now seen corresponding path program 2 times [2022-04-08 10:41:51,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:41:51,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077645317] [2022-04-08 10:41:51,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:41:51,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:41:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:41:51,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:41:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:41:51,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-08 10:41:51,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-08 10:41:51,988 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2022-04-08 10:41:51,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 10:41:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:41:51,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-08 10:41:52,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-08 10:41:52,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-08 10:41:52,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #75#return; {40#false} is VALID [2022-04-08 10:41:52,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:41:52,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-08 10:41:52,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-08 10:41:52,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2022-04-08 10:41:52,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret6 := main(); {39#true} is VALID [2022-04-08 10:41:52,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {39#true} is VALID [2022-04-08 10:41:52,003 INFO L272 TraceCheckUtils]: 6: Hoare triple {39#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {39#true} is VALID [2022-04-08 10:41:52,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-08 10:41:52,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-08 10:41:52,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-08 10:41:52,004 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} #75#return; {40#false} is VALID [2022-04-08 10:41:52,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#false} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {40#false} is VALID [2022-04-08 10:41:52,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} assume false; {40#false} is VALID [2022-04-08 10:41:52,006 INFO L272 TraceCheckUtils]: 13: Hoare triple {40#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {40#false} is VALID [2022-04-08 10:41:52,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2022-04-08 10:41:52,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2022-04-08 10:41:52,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-08 10:41:52,007 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-08 10:41:52,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:41:52,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077645317] [2022-04-08 10:41:52,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077645317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:41:52,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:41:52,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:41:52,012 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:41:52,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1325084952] [2022-04-08 10:41:52,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1325084952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:41:52,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:41:52,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:41:52,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237135104] [2022-04-08 10:41:52,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:41:52,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 10:41:52,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:41:52,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 10:41:52,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:41:52,046 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 10:41:52,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:41:52,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 10:41:52,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:41:52,073 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 10:41:52,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:41:52,242 INFO L93 Difference]: Finished difference Result 63 states and 95 transitions. [2022-04-08 10:41:52,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 10:41:52,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 10:41:52,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:41:52,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 10:41:52,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-08 10:41:52,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 10:41:52,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-08 10:41:52,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-08 10:41:52,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:41:52,373 INFO L225 Difference]: With dead ends: 63 [2022-04-08 10:41:52,373 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 10:41:52,375 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:41:52,378 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:41:52,379 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:41:52,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 10:41:52,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 10:41:52,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:41:52,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 10:41:52,409 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 10:41:52,409 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 10:41:52,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:41:52,412 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-08 10:41:52,412 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-08 10:41:52,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:41:52,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:41:52,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 31 states. [2022-04-08 10:41:52,413 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 31 states. [2022-04-08 10:41:52,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:41:52,415 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-08 10:41:52,415 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-08 10:41:52,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:41:52,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:41:52,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:41:52,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:41:52,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 10:41:52,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-04-08 10:41:52,419 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 17 [2022-04-08 10:41:52,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:41:52,419 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-04-08 10:41:52,420 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 10:41:52,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 38 transitions. [2022-04-08 10:41:52,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:41:52,455 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-08 10:41:52,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 10:41:52,455 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:41:52,455 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:41:52,455 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 10:41:52,456 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:41:52,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:41:52,456 INFO L85 PathProgramCache]: Analyzing trace with hash 2071348352, now seen corresponding path program 1 times [2022-04-08 10:41:52,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:41:52,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1957729316] [2022-04-08 10:41:52,457 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:41:52,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2071348352, now seen corresponding path program 2 times [2022-04-08 10:41:52,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:41:52,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53681261] [2022-04-08 10:41:52,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:41:52,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:41:52,470 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:41:52,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1823583594] [2022-04-08 10:41:52,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:41:52,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:41:52,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:41:52,472 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-08 10:41:52,473 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-08 10:41:52,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 10:41:52,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:41:52,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 10:41:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:41:52,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:41:52,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {301#true} is VALID [2022-04-08 10:41:52,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#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(14, 2);call #Ultimate.allocInit(12, 3); {301#true} is VALID [2022-04-08 10:41:52,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-08 10:41:52,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #91#return; {301#true} is VALID [2022-04-08 10:41:52,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret6 := main(); {301#true} is VALID [2022-04-08 10:41:52,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {301#true} is VALID [2022-04-08 10:41:52,644 INFO L272 TraceCheckUtils]: 6: Hoare triple {301#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {301#true} is VALID [2022-04-08 10:41:52,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-08 10:41:52,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-08 10:41:52,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-08 10:41:52,645 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {301#true} {301#true} #75#return; {301#true} is VALID [2022-04-08 10:41:52,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {301#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {339#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-08 10:41:52,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {339#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false; {339#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-08 10:41:52,647 INFO L272 TraceCheckUtils]: 13: Hoare triple {339#(and (= main_~a~0 0) (= main_~b~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {346#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:41:52,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {346#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {350#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:41:52,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {350#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {302#false} is VALID [2022-04-08 10:41:52,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {302#false} assume !false; {302#false} is VALID [2022-04-08 10:41:52,648 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-08 10:41:52,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 10:41:52,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:41:52,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53681261] [2022-04-08 10:41:52,649 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:41:52,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823583594] [2022-04-08 10:41:52,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823583594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:41:52,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:41:52,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:41:52,650 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:41:52,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1957729316] [2022-04-08 10:41:52,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1957729316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:41:52,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:41:52,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:41:52,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058772981] [2022-04-08 10:41:52,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:41:52,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 10:41:52,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:41:52,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 10:41:52,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:41:52,664 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:41:52,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:41:52,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:41:52,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:41:52,665 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 10:41:52,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:41:52,796 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-08 10:41:52,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:41:52,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 10:41:52,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:41:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 10:41:52,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-08 10:41:52,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 10:41:52,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-08 10:41:52,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-08 10:41:52,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:41:52,850 INFO L225 Difference]: With dead ends: 42 [2022-04-08 10:41:52,850 INFO L226 Difference]: Without dead ends: 40 [2022-04-08 10:41:52,851 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-08 10:41:52,853 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:41:52,856 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 129 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:41:52,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-08 10:41:52,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-04-08 10:41:52,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:41:52,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 10:41:52,870 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 10:41:52,872 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 10:41:52,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:41:52,878 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-08 10:41:52,878 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-08 10:41:52,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:41:52,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:41:52,883 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 40 states. [2022-04-08 10:41:52,883 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 40 states. [2022-04-08 10:41:52,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:41:52,890 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-08 10:41:52,890 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-08 10:41:52,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:41:52,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:41:52,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:41:52,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:41:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 10:41:52,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-04-08 10:41:52,896 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 17 [2022-04-08 10:41:52,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:41:52,896 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-04-08 10:41:52,896 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 10:41:52,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 44 transitions. [2022-04-08 10:41:52,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:41:52,940 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-08 10:41:52,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:41:52,941 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:41:52,942 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:41:52,960 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-08 10:41:53,147 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:41:53,150 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:41:53,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:41:53,150 INFO L85 PathProgramCache]: Analyzing trace with hash 933849696, now seen corresponding path program 1 times [2022-04-08 10:41:53,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:41:53,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [462186616] [2022-04-08 10:41:53,151 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:41:53,151 INFO L85 PathProgramCache]: Analyzing trace with hash 933849696, now seen corresponding path program 2 times [2022-04-08 10:41:53,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:41:53,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951354861] [2022-04-08 10:41:53,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:41:53,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:41:53,161 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:41:53,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2034970731] [2022-04-08 10:41:53,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:41:53,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:41:53,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:41:53,163 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-08 10:41:53,164 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-08 10:41:53,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:41:53,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:41:53,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 10:41:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:41:53,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:41:53,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {596#true} call ULTIMATE.init(); {596#true} is VALID [2022-04-08 10:41:53,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {596#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(14, 2);call #Ultimate.allocInit(12, 3); {596#true} is VALID [2022-04-08 10:41:53,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-08 10:41:53,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {596#true} {596#true} #91#return; {596#true} is VALID [2022-04-08 10:41:53,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {596#true} call #t~ret6 := main(); {596#true} is VALID [2022-04-08 10:41:53,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {596#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {596#true} is VALID [2022-04-08 10:41:53,326 INFO L272 TraceCheckUtils]: 6: Hoare triple {596#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {596#true} is VALID [2022-04-08 10:41:53,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {596#true} ~cond := #in~cond; {596#true} is VALID [2022-04-08 10:41:53,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {596#true} assume !(0 == ~cond); {596#true} is VALID [2022-04-08 10:41:53,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-08 10:41:53,326 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {596#true} {596#true} #75#return; {596#true} is VALID [2022-04-08 10:41:53,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {596#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 10:41:53,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !false; {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 10:41:53,332 INFO L272 TraceCheckUtils]: 13: Hoare triple {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {596#true} is VALID [2022-04-08 10:41:53,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {596#true} ~cond := #in~cond; {596#true} is VALID [2022-04-08 10:41:53,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {596#true} assume !(0 == ~cond); {596#true} is VALID [2022-04-08 10:41:53,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-08 10:41:53,333 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {596#true} {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #77#return; {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 10:41:53,334 INFO L272 TraceCheckUtils]: 18: Hoare triple {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {656#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:41:53,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {656#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {660#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:41:53,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {660#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {597#false} is VALID [2022-04-08 10:41:53,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {597#false} assume !false; {597#false} is VALID [2022-04-08 10:41:53,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:41:53,335 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 10:41:53,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:41:53,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951354861] [2022-04-08 10:41:53,335 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:41:53,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034970731] [2022-04-08 10:41:53,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034970731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:41:53,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:41:53,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:41:53,336 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:41:53,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [462186616] [2022-04-08 10:41:53,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [462186616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:41:53,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:41:53,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:41:53,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061777823] [2022-04-08 10:41:53,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:41:53,337 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 10:41:53,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:41:53,337 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 10:41:53,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:41:53,352 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:41:53,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:41:53,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:41:53,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:41:53,352 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 10:41:53,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:41:53,538 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2022-04-08 10:41:53,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:41:53,538 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 10:41:53,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:41:53,538 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 10:41:53,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-08 10:41:53,540 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 10:41:53,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-08 10:41:53,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-08 10:41:53,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:41:53,590 INFO L225 Difference]: With dead ends: 54 [2022-04-08 10:41:53,590 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 10:41:53,590 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-08 10:41:53,591 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 11 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:41:53,591 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 123 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:41:53,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 10:41:53,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-08 10:41:53,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:41:53,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 10:41:53,603 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 10:41:53,603 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 10:41:53,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:41:53,605 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-04-08 10:41:53,605 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-08 10:41:53,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:41:53,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:41:53,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 51 states. [2022-04-08 10:41:53,606 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 51 states. [2022-04-08 10:41:53,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:41:53,608 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-04-08 10:41:53,608 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-08 10:41:53,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:41:53,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:41:53,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:41:53,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:41:53,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 10:41:53,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-08 10:41:53,613 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 22 [2022-04-08 10:41:53,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:41:53,613 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-08 10:41:53,613 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 10:41:53,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 62 transitions. [2022-04-08 10:41:53,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:41:53,669 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-08 10:41:53,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:41:53,670 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:41:53,670 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:41:53,689 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-08 10:41:53,883 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 10:41:53,883 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:41:53,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:41:53,884 INFO L85 PathProgramCache]: Analyzing trace with hash 721086345, now seen corresponding path program 1 times [2022-04-08 10:41:53,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:41:53,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [739713446] [2022-04-08 10:41:53,884 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:41:53,885 INFO L85 PathProgramCache]: Analyzing trace with hash 721086345, now seen corresponding path program 2 times [2022-04-08 10:41:53,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:41:53,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604469] [2022-04-08 10:41:53,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:41:53,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:41:53,897 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:41:53,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1468655966] [2022-04-08 10:41:53,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:41:53,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:41:53,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:41:53,898 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-08 10:41:53,912 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-08 10:41:53,942 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:41:53,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:41:53,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 10:41:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:41:53,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:41:54,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {978#true} call ULTIMATE.init(); {978#true} is VALID [2022-04-08 10:41:54,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {978#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(14, 2);call #Ultimate.allocInit(12, 3); {978#true} is VALID [2022-04-08 10:41:54,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {978#true} assume true; {978#true} is VALID [2022-04-08 10:41:54,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {978#true} {978#true} #91#return; {978#true} is VALID [2022-04-08 10:41:54,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {978#true} call #t~ret6 := main(); {978#true} is VALID [2022-04-08 10:41:54,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {978#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {978#true} is VALID [2022-04-08 10:41:54,046 INFO L272 TraceCheckUtils]: 6: Hoare triple {978#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {978#true} is VALID [2022-04-08 10:41:54,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {978#true} ~cond := #in~cond; {978#true} is VALID [2022-04-08 10:41:54,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {978#true} assume !(0 == ~cond); {978#true} is VALID [2022-04-08 10:41:54,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {978#true} assume true; {978#true} is VALID [2022-04-08 10:41:54,046 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {978#true} {978#true} #75#return; {978#true} is VALID [2022-04-08 10:41:54,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {978#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {978#true} is VALID [2022-04-08 10:41:54,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {978#true} assume !false; {978#true} is VALID [2022-04-08 10:41:54,046 INFO L272 TraceCheckUtils]: 13: Hoare triple {978#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {978#true} is VALID [2022-04-08 10:41:54,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {978#true} ~cond := #in~cond; {978#true} is VALID [2022-04-08 10:41:54,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {978#true} assume !(0 == ~cond); {978#true} is VALID [2022-04-08 10:41:54,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {978#true} assume true; {978#true} is VALID [2022-04-08 10:41:54,047 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {978#true} {978#true} #77#return; {978#true} is VALID [2022-04-08 10:41:54,047 INFO L272 TraceCheckUtils]: 18: Hoare triple {978#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {978#true} is VALID [2022-04-08 10:41:54,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {978#true} ~cond := #in~cond; {978#true} is VALID [2022-04-08 10:41:54,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {978#true} assume !(0 == ~cond); {978#true} is VALID [2022-04-08 10:41:54,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {978#true} assume true; {978#true} is VALID [2022-04-08 10:41:54,047 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {978#true} {978#true} #79#return; {978#true} is VALID [2022-04-08 10:41:54,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {978#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1052#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-08 10:41:54,048 INFO L290 TraceCheckUtils]: 24: Hoare triple {1052#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} assume !false; {1052#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-08 10:41:54,049 INFO L272 TraceCheckUtils]: 25: Hoare triple {1052#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1059#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:41:54,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {1059#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1063#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:41:54,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {1063#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {979#false} is VALID [2022-04-08 10:41:54,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {979#false} assume !false; {979#false} is VALID [2022-04-08 10:41:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:41:54,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 10:41:54,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:41:54,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604469] [2022-04-08 10:41:54,050 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:41:54,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468655966] [2022-04-08 10:41:54,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468655966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:41:54,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:41:54,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:41:54,051 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:41:54,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [739713446] [2022-04-08 10:41:54,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [739713446] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:41:54,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:41:54,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:41:54,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769934139] [2022-04-08 10:41:54,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:41:54,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-08 10:41:54,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:41:54,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 10:41:54,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:41:54,070 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:41:54,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:41:54,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:41:54,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:41:54,071 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 10:41:54,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:41:54,260 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2022-04-08 10:41:54,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:41:54,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-08 10:41:54,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:41:54,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 10:41:54,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-08 10:41:54,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 10:41:54,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-08 10:41:54,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-08 10:41:54,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:41:54,312 INFO L225 Difference]: With dead ends: 76 [2022-04-08 10:41:54,312 INFO L226 Difference]: Without dead ends: 74 [2022-04-08 10:41:54,312 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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-08 10:41:54,313 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:41:54,313 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 126 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:41:54,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-08 10:41:54,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2022-04-08 10:41:54,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:41:54,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 10:41:54,350 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 10:41:54,351 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 10:41:54,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:41:54,355 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-04-08 10:41:54,355 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-04-08 10:41:54,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:41:54,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:41:54,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 74 states. [2022-04-08 10:41:54,357 INFO L87 Difference]: Start difference. First operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 74 states. [2022-04-08 10:41:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:41:54,361 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-04-08 10:41:54,361 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-04-08 10:41:54,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:41:54,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:41:54,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:41:54,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:41:54,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 10:41:54,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2022-04-08 10:41:54,365 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 29 [2022-04-08 10:41:54,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:41:54,366 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2022-04-08 10:41:54,366 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 10:41:54,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 87 transitions. [2022-04-08 10:41:54,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:41:54,437 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2022-04-08 10:41:54,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 10:41:54,437 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:41:54,437 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:41:54,455 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-08 10:41:54,651 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:41:54,651 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:41:54,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:41:54,652 INFO L85 PathProgramCache]: Analyzing trace with hash -607067127, now seen corresponding path program 1 times [2022-04-08 10:41:54,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:41:54,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1403006384] [2022-04-08 10:41:54,652 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:41:54,652 INFO L85 PathProgramCache]: Analyzing trace with hash -607067127, now seen corresponding path program 2 times [2022-04-08 10:41:54,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:41:54,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771246121] [2022-04-08 10:41:54,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:41:54,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:41:54,663 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:41:54,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1034073619] [2022-04-08 10:41:54,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:41:54,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:41:54,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:41:54,664 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-08 10:41:54,665 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-08 10:41:54,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:41:54,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:41:54,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 10:41:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:41:54,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:41:54,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {1505#true} call ULTIMATE.init(); {1505#true} is VALID [2022-04-08 10:41:54,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {1505#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(14, 2);call #Ultimate.allocInit(12, 3); {1505#true} is VALID [2022-04-08 10:41:54,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-08 10:41:54,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1505#true} {1505#true} #91#return; {1505#true} is VALID [2022-04-08 10:41:54,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {1505#true} call #t~ret6 := main(); {1505#true} is VALID [2022-04-08 10:41:54,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {1505#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1505#true} is VALID [2022-04-08 10:41:54,856 INFO L272 TraceCheckUtils]: 6: Hoare triple {1505#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1505#true} is VALID [2022-04-08 10:41:54,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {1505#true} ~cond := #in~cond; {1531#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 10:41:54,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {1531#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1535#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 10:41:54,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {1535#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1535#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 10:41:54,857 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1535#(not (= |assume_abort_if_not_#in~cond| 0))} {1505#true} #75#return; {1542#(<= 1 main_~y~0)} is VALID [2022-04-08 10:41:54,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {1542#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1542#(<= 1 main_~y~0)} is VALID [2022-04-08 10:41:54,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {1542#(<= 1 main_~y~0)} assume !false; {1542#(<= 1 main_~y~0)} is VALID [2022-04-08 10:41:54,864 INFO L272 TraceCheckUtils]: 13: Hoare triple {1542#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1505#true} is VALID [2022-04-08 10:41:54,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-04-08 10:41:54,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {1505#true} assume !(0 == ~cond); {1505#true} is VALID [2022-04-08 10:41:54,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-08 10:41:54,864 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1505#true} {1542#(<= 1 main_~y~0)} #77#return; {1542#(<= 1 main_~y~0)} is VALID [2022-04-08 10:41:54,865 INFO L272 TraceCheckUtils]: 18: Hoare triple {1542#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1505#true} is VALID [2022-04-08 10:41:54,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-04-08 10:41:54,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {1505#true} assume !(0 == ~cond); {1505#true} is VALID [2022-04-08 10:41:54,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-08 10:41:54,866 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1505#true} {1542#(<= 1 main_~y~0)} #79#return; {1542#(<= 1 main_~y~0)} is VALID [2022-04-08 10:41:54,867 INFO L290 TraceCheckUtils]: 23: Hoare triple {1542#(<= 1 main_~y~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1582#(<= 1 main_~r~0)} is VALID [2022-04-08 10:41:54,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {1582#(<= 1 main_~r~0)} assume !false; {1582#(<= 1 main_~r~0)} is VALID [2022-04-08 10:41:54,868 INFO L272 TraceCheckUtils]: 25: Hoare triple {1582#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1505#true} is VALID [2022-04-08 10:41:54,869 INFO L290 TraceCheckUtils]: 26: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-04-08 10:41:54,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {1505#true} assume !(0 == ~cond); {1505#true} is VALID [2022-04-08 10:41:54,879 INFO L290 TraceCheckUtils]: 28: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-08 10:41:54,883 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1505#true} {1582#(<= 1 main_~r~0)} #81#return; {1582#(<= 1 main_~r~0)} is VALID [2022-04-08 10:41:54,883 INFO L272 TraceCheckUtils]: 30: Hoare triple {1582#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1505#true} is VALID [2022-04-08 10:41:54,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-04-08 10:41:54,883 INFO L290 TraceCheckUtils]: 32: Hoare triple {1505#true} assume !(0 == ~cond); {1505#true} is VALID [2022-04-08 10:41:54,883 INFO L290 TraceCheckUtils]: 33: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-08 10:41:54,883 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1505#true} {1582#(<= 1 main_~r~0)} #83#return; {1582#(<= 1 main_~r~0)} is VALID [2022-04-08 10:41:54,884 INFO L272 TraceCheckUtils]: 35: Hoare triple {1582#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {1619#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:41:54,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {1619#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1623#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:41:54,885 INFO L290 TraceCheckUtils]: 37: Hoare triple {1623#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1506#false} is VALID [2022-04-08 10:41:54,885 INFO L290 TraceCheckUtils]: 38: Hoare triple {1506#false} assume !false; {1506#false} is VALID [2022-04-08 10:41:54,885 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 10:41:54,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 10:41:54,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:41:54,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771246121] [2022-04-08 10:41:54,885 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:41:54,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034073619] [2022-04-08 10:41:54,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034073619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:41:54,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:41:54,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:41:54,886 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:41:54,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1403006384] [2022-04-08 10:41:54,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1403006384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:41:54,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:41:54,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:41:54,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434575971] [2022-04-08 10:41:54,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:41:54,886 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-04-08 10:41:54,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:41:54,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 10:41:54,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:41:54,905 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:41:54,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:41:54,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:41:54,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-08 10:41:54,906 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 10:41:55,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:41:55,186 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-08 10:41:55,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:41:55,186 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-04-08 10:41:55,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:41:55,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 10:41:55,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-08 10:41:55,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 10:41:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-08 10:41:55,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-08 10:41:55,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:41:55,220 INFO L225 Difference]: With dead ends: 73 [2022-04-08 10:41:55,220 INFO L226 Difference]: Without dead ends: 71 [2022-04-08 10:41:55,221 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-08 10:41:55,222 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:41:55,222 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 145 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:41:55,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-08 10:41:55,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-08 10:41:55,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:41:55,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 10:41:55,295 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 10:41:55,296 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 10:41:55,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:41:55,298 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-04-08 10:41:55,298 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-08 10:41:55,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:41:55,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:41:55,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 71 states. [2022-04-08 10:41:55,299 INFO L87 Difference]: Start difference. First operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 71 states. [2022-04-08 10:41:55,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:41:55,301 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-04-08 10:41:55,301 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-08 10:41:55,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:41:55,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:41:55,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:41:55,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:41:55,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 10:41:55,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2022-04-08 10:41:55,304 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 39 [2022-04-08 10:41:55,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:41:55,304 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2022-04-08 10:41:55,304 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 10:41:55,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 90 transitions. [2022-04-08 10:41:55,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:41:55,378 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-08 10:41:55,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 10:41:55,378 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:41:55,378 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:41:55,394 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-08 10:41:55,587 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:41:55,587 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:41:55,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:41:55,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1279335692, now seen corresponding path program 1 times [2022-04-08 10:41:55,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:41:55,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [167731591] [2022-04-08 10:41:55,588 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:41:55,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1279335692, now seen corresponding path program 2 times [2022-04-08 10:41:55,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:41:55,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82226480] [2022-04-08 10:41:55,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:41:55,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:41:55,602 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:41:55,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1521828734] [2022-04-08 10:41:55,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:41:55,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:41:55,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:41:55,607 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-08 10:41:55,608 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-08 10:41:55,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:41:55,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:41:55,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 10:41:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:41:55,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:41:55,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {2065#true} call ULTIMATE.init(); {2065#true} is VALID [2022-04-08 10:41:55,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {2065#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(14, 2);call #Ultimate.allocInit(12, 3); {2065#true} is VALID [2022-04-08 10:41:55,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-08 10:41:55,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2065#true} {2065#true} #91#return; {2065#true} is VALID [2022-04-08 10:41:55,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {2065#true} call #t~ret6 := main(); {2065#true} is VALID [2022-04-08 10:41:55,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {2065#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2065#true} is VALID [2022-04-08 10:41:55,953 INFO L272 TraceCheckUtils]: 6: Hoare triple {2065#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2065#true} is VALID [2022-04-08 10:41:55,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-08 10:41:55,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-08 10:41:55,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-08 10:41:55,954 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2065#true} {2065#true} #75#return; {2065#true} is VALID [2022-04-08 10:41:55,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {2065#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2065#true} is VALID [2022-04-08 10:41:55,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {2065#true} assume !false; {2065#true} is VALID [2022-04-08 10:41:55,954 INFO L272 TraceCheckUtils]: 13: Hoare triple {2065#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2065#true} is VALID [2022-04-08 10:41:55,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-08 10:41:55,954 INFO L290 TraceCheckUtils]: 15: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-08 10:41:55,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-08 10:41:55,954 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2065#true} {2065#true} #77#return; {2065#true} is VALID [2022-04-08 10:41:55,954 INFO L272 TraceCheckUtils]: 18: Hoare triple {2065#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2065#true} is VALID [2022-04-08 10:41:55,954 INFO L290 TraceCheckUtils]: 19: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-08 10:41:55,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-08 10:41:55,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-08 10:41:55,955 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2065#true} {2065#true} #79#return; {2065#true} is VALID [2022-04-08 10:41:55,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {2065#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2065#true} is VALID [2022-04-08 10:41:55,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {2065#true} assume !false; {2065#true} is VALID [2022-04-08 10:41:55,955 INFO L272 TraceCheckUtils]: 25: Hoare triple {2065#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2065#true} is VALID [2022-04-08 10:41:55,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {2065#true} ~cond := #in~cond; {2148#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:41:55,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {2148#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:41:55,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:41:55,957 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} {2065#true} #81#return; {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-08 10:41:55,957 INFO L272 TraceCheckUtils]: 30: Hoare triple {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2065#true} is VALID [2022-04-08 10:41:55,957 INFO L290 TraceCheckUtils]: 31: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-08 10:41:55,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-08 10:41:55,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-08 10:41:55,958 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2065#true} {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} #83#return; {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-08 10:41:55,958 INFO L272 TraceCheckUtils]: 35: Hoare triple {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2065#true} is VALID [2022-04-08 10:41:55,958 INFO L290 TraceCheckUtils]: 36: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-08 10:41:55,958 INFO L290 TraceCheckUtils]: 37: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-08 10:41:55,958 INFO L290 TraceCheckUtils]: 38: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-08 10:41:55,958 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2065#true} {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} #85#return; {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-08 10:41:55,959 INFO L290 TraceCheckUtils]: 40: Hoare triple {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} assume !!(~r~0 >= 2 * ~b~0); {2193#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-08 10:41:55,960 INFO L272 TraceCheckUtils]: 41: Hoare triple {2193#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {2197#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:41:55,960 INFO L290 TraceCheckUtils]: 42: Hoare triple {2197#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2201#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:41:55,960 INFO L290 TraceCheckUtils]: 43: Hoare triple {2201#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2066#false} is VALID [2022-04-08 10:41:55,960 INFO L290 TraceCheckUtils]: 44: Hoare triple {2066#false} assume !false; {2066#false} is VALID [2022-04-08 10:41:55,961 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:41:55,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:42:00,396 INFO L290 TraceCheckUtils]: 44: Hoare triple {2066#false} assume !false; {2066#false} is VALID [2022-04-08 10:42:00,397 INFO L290 TraceCheckUtils]: 43: Hoare triple {2201#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2066#false} is VALID [2022-04-08 10:42:00,397 INFO L290 TraceCheckUtils]: 42: Hoare triple {2197#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2201#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:42:00,398 INFO L272 TraceCheckUtils]: 41: Hoare triple {2193#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {2197#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:42:00,399 INFO L290 TraceCheckUtils]: 40: Hoare triple {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} assume !!(~r~0 >= 2 * ~b~0); {2193#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-08 10:42:00,399 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2065#true} {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #85#return; {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-08 10:42:00,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-08 10:42:00,400 INFO L290 TraceCheckUtils]: 37: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-08 10:42:00,400 INFO L290 TraceCheckUtils]: 36: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-08 10:42:00,400 INFO L272 TraceCheckUtils]: 35: Hoare triple {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2065#true} is VALID [2022-04-08 10:42:00,401 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2065#true} {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #83#return; {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-08 10:42:00,401 INFO L290 TraceCheckUtils]: 33: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-08 10:42:00,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-08 10:42:00,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-08 10:42:00,401 INFO L272 TraceCheckUtils]: 30: Hoare triple {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2065#true} is VALID [2022-04-08 10:42:00,401 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} {2065#true} #81#return; {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-08 10:42:00,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:42:00,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {2263#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:42:00,402 INFO L290 TraceCheckUtils]: 26: Hoare triple {2065#true} ~cond := #in~cond; {2263#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:42:00,403 INFO L272 TraceCheckUtils]: 25: Hoare triple {2065#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2065#true} is VALID [2022-04-08 10:42:00,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {2065#true} assume !false; {2065#true} is VALID [2022-04-08 10:42:00,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {2065#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2065#true} is VALID [2022-04-08 10:42:00,403 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2065#true} {2065#true} #79#return; {2065#true} is VALID [2022-04-08 10:42:00,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-08 10:42:00,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-08 10:42:00,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-08 10:42:00,403 INFO L272 TraceCheckUtils]: 18: Hoare triple {2065#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2065#true} is VALID [2022-04-08 10:42:00,403 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2065#true} {2065#true} #77#return; {2065#true} is VALID [2022-04-08 10:42:00,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-08 10:42:00,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-08 10:42:00,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-08 10:42:00,403 INFO L272 TraceCheckUtils]: 13: Hoare triple {2065#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2065#true} is VALID [2022-04-08 10:42:00,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {2065#true} assume !false; {2065#true} is VALID [2022-04-08 10:42:00,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {2065#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2065#true} is VALID [2022-04-08 10:42:00,404 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2065#true} {2065#true} #75#return; {2065#true} is VALID [2022-04-08 10:42:00,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-08 10:42:00,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-08 10:42:00,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-08 10:42:00,404 INFO L272 TraceCheckUtils]: 6: Hoare triple {2065#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2065#true} is VALID [2022-04-08 10:42:00,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {2065#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2065#true} is VALID [2022-04-08 10:42:00,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {2065#true} call #t~ret6 := main(); {2065#true} is VALID [2022-04-08 10:42:00,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2065#true} {2065#true} #91#return; {2065#true} is VALID [2022-04-08 10:42:00,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-08 10:42:00,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {2065#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(14, 2);call #Ultimate.allocInit(12, 3); {2065#true} is VALID [2022-04-08 10:42:00,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {2065#true} call ULTIMATE.init(); {2065#true} is VALID [2022-04-08 10:42:00,405 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:42:00,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:42:00,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82226480] [2022-04-08 10:42:00,405 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:42:00,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521828734] [2022-04-08 10:42:00,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521828734] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:42:00,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:42:00,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 10:42:00,405 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:42:00,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [167731591] [2022-04-08 10:42:00,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [167731591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:42:00,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:42:00,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:42:00,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204293481] [2022-04-08 10:42:00,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:42:00,406 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2022-04-08 10:42:00,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:42:00,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 10:42:00,430 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-08 10:42:00,431 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:42:00,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:42:00,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:42:00,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:42:00,431 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 10:42:00,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:42:00,758 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2022-04-08 10:42:00,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:42:00,759 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2022-04-08 10:42:00,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:42:00,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 10:42:00,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-08 10:42:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 10:42:00,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-08 10:42:00,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-08 10:42:00,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:42:00,796 INFO L225 Difference]: With dead ends: 77 [2022-04-08 10:42:00,796 INFO L226 Difference]: Without dead ends: 75 [2022-04-08 10:42:00,797 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:42:00,797 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 18 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:42:00,797 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 95 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:42:00,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-08 10:42:00,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-08 10:42:00,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:42:00,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 10:42:00,855 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 10:42:00,855 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 10:42:00,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:42:00,860 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-04-08 10:42:00,860 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-08 10:42:00,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:42:00,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:42:00,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 75 states. [2022-04-08 10:42:00,860 INFO L87 Difference]: Start difference. First operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 75 states. [2022-04-08 10:42:00,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:42:00,863 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-04-08 10:42:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-08 10:42:00,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:42:00,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:42:00,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:42:00,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:42:00,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 10:42:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 93 transitions. [2022-04-08 10:42:00,865 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 93 transitions. Word has length 45 [2022-04-08 10:42:00,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:42:00,866 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 93 transitions. [2022-04-08 10:42:00,866 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 10:42:00,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 93 transitions. [2022-04-08 10:42:00,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:42:00,970 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-08 10:42:00,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-08 10:42:00,971 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:42:00,971 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:42:00,990 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-08 10:42:01,176 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:42:01,177 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:42:01,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:42:01,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1789016266, now seen corresponding path program 1 times [2022-04-08 10:42:01,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:42:01,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2038474620] [2022-04-08 10:42:11,857 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:42:11,858 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:42:11,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1789016266, now seen corresponding path program 2 times [2022-04-08 10:42:11,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:42:11,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898556205] [2022-04-08 10:42:11,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:42:11,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:42:11,879 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:42:11,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1661930521] [2022-04-08 10:42:11,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:42:11,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:42:11,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:42:11,882 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-08 10:42:11,883 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-08 10:42:11,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:42:11,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:42:11,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 10:42:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:42:11,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:42:12,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {2804#true} call ULTIMATE.init(); {2804#true} is VALID [2022-04-08 10:42:12,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {2804#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(14, 2);call #Ultimate.allocInit(12, 3); {2804#true} is VALID [2022-04-08 10:42:12,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-08 10:42:12,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2804#true} {2804#true} #91#return; {2804#true} is VALID [2022-04-08 10:42:12,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {2804#true} call #t~ret6 := main(); {2804#true} is VALID [2022-04-08 10:42:12,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {2804#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2804#true} is VALID [2022-04-08 10:42:12,186 INFO L272 TraceCheckUtils]: 6: Hoare triple {2804#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2804#true} is VALID [2022-04-08 10:42:12,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-08 10:42:12,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-08 10:42:12,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-08 10:42:12,187 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2804#true} {2804#true} #75#return; {2804#true} is VALID [2022-04-08 10:42:12,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {2804#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2842#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 10:42:12,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {2842#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !false; {2842#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 10:42:12,188 INFO L272 TraceCheckUtils]: 13: Hoare triple {2842#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2804#true} is VALID [2022-04-08 10:42:12,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-08 10:42:12,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-08 10:42:12,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-08 10:42:12,189 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2804#true} {2842#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #77#return; {2842#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 10:42:12,189 INFO L272 TraceCheckUtils]: 18: Hoare triple {2842#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2804#true} is VALID [2022-04-08 10:42:12,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-08 10:42:12,189 INFO L290 TraceCheckUtils]: 20: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-08 10:42:12,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-08 10:42:12,194 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2804#true} {2842#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {2842#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 10:42:12,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {2842#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 10:42:12,196 INFO L290 TraceCheckUtils]: 24: Hoare triple {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 10:42:12,199 INFO L272 TraceCheckUtils]: 25: Hoare triple {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2804#true} is VALID [2022-04-08 10:42:12,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-08 10:42:12,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-08 10:42:12,200 INFO L290 TraceCheckUtils]: 28: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-08 10:42:12,201 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2804#true} {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #81#return; {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 10:42:12,201 INFO L272 TraceCheckUtils]: 30: Hoare triple {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2804#true} is VALID [2022-04-08 10:42:12,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-08 10:42:12,202 INFO L290 TraceCheckUtils]: 32: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-08 10:42:12,202 INFO L290 TraceCheckUtils]: 33: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-08 10:42:12,205 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2804#true} {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #83#return; {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 10:42:12,205 INFO L272 TraceCheckUtils]: 35: Hoare triple {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2804#true} is VALID [2022-04-08 10:42:12,205 INFO L290 TraceCheckUtils]: 36: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-08 10:42:12,205 INFO L290 TraceCheckUtils]: 37: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-08 10:42:12,206 INFO L290 TraceCheckUtils]: 38: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-08 10:42:12,206 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2804#true} {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #85#return; {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 10:42:12,207 INFO L290 TraceCheckUtils]: 40: Hoare triple {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !(~r~0 >= 2 * ~b~0); {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 10:42:12,207 INFO L290 TraceCheckUtils]: 41: Hoare triple {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {2934#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-08 10:42:12,207 INFO L290 TraceCheckUtils]: 42: Hoare triple {2934#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} assume !false; {2934#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-08 10:42:12,208 INFO L272 TraceCheckUtils]: 43: Hoare triple {2934#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2804#true} is VALID [2022-04-08 10:42:12,208 INFO L290 TraceCheckUtils]: 44: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-08 10:42:12,208 INFO L290 TraceCheckUtils]: 45: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-08 10:42:12,208 INFO L290 TraceCheckUtils]: 46: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-08 10:42:12,208 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {2804#true} {2934#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} #77#return; {2934#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-08 10:42:12,209 INFO L272 TraceCheckUtils]: 48: Hoare triple {2934#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2956#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:42:12,209 INFO L290 TraceCheckUtils]: 49: Hoare triple {2956#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2960#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:42:12,210 INFO L290 TraceCheckUtils]: 50: Hoare triple {2960#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2805#false} is VALID [2022-04-08 10:42:12,210 INFO L290 TraceCheckUtils]: 51: Hoare triple {2805#false} assume !false; {2805#false} is VALID [2022-04-08 10:42:12,211 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 10:42:12,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:42:12,423 INFO L290 TraceCheckUtils]: 51: Hoare triple {2805#false} assume !false; {2805#false} is VALID [2022-04-08 10:42:12,423 INFO L290 TraceCheckUtils]: 50: Hoare triple {2960#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2805#false} is VALID [2022-04-08 10:42:12,424 INFO L290 TraceCheckUtils]: 49: Hoare triple {2956#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2960#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:42:12,424 INFO L272 TraceCheckUtils]: 48: Hoare triple {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2956#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:42:12,425 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {2804#true} {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #77#return; {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 10:42:12,425 INFO L290 TraceCheckUtils]: 46: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-08 10:42:12,425 INFO L290 TraceCheckUtils]: 45: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-08 10:42:12,425 INFO L290 TraceCheckUtils]: 44: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-08 10:42:12,425 INFO L272 TraceCheckUtils]: 43: Hoare triple {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2804#true} is VALID [2022-04-08 10:42:12,425 INFO L290 TraceCheckUtils]: 42: Hoare triple {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !false; {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 10:42:12,433 INFO L290 TraceCheckUtils]: 41: Hoare triple {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 10:42:12,433 INFO L290 TraceCheckUtils]: 40: Hoare triple {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !(~r~0 >= 2 * ~b~0); {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 10:42:12,434 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2804#true} {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #85#return; {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 10:42:12,434 INFO L290 TraceCheckUtils]: 38: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-08 10:42:12,434 INFO L290 TraceCheckUtils]: 37: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-08 10:42:12,434 INFO L290 TraceCheckUtils]: 36: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-08 10:42:12,434 INFO L272 TraceCheckUtils]: 35: Hoare triple {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2804#true} is VALID [2022-04-08 10:42:12,435 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2804#true} {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #83#return; {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 10:42:12,435 INFO L290 TraceCheckUtils]: 33: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-08 10:42:12,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-08 10:42:12,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-08 10:42:12,435 INFO L272 TraceCheckUtils]: 30: Hoare triple {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2804#true} is VALID [2022-04-08 10:42:12,439 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2804#true} {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #81#return; {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 10:42:12,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-08 10:42:12,440 INFO L290 TraceCheckUtils]: 27: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-08 10:42:12,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-08 10:42:12,440 INFO L272 TraceCheckUtils]: 25: Hoare triple {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2804#true} is VALID [2022-04-08 10:42:12,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !false; {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 10:42:12,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 10:42:12,441 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2804#true} {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #79#return; {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 10:42:12,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-08 10:42:12,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-08 10:42:12,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-08 10:42:12,441 INFO L272 TraceCheckUtils]: 18: Hoare triple {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2804#true} is VALID [2022-04-08 10:42:12,442 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2804#true} {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #77#return; {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 10:42:12,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-08 10:42:12,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-08 10:42:12,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-08 10:42:12,442 INFO L272 TraceCheckUtils]: 13: Hoare triple {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2804#true} is VALID [2022-04-08 10:42:12,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !false; {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 10:42:12,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {2804#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 10:42:12,443 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2804#true} {2804#true} #75#return; {2804#true} is VALID [2022-04-08 10:42:12,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-08 10:42:12,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-08 10:42:12,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-08 10:42:12,443 INFO L272 TraceCheckUtils]: 6: Hoare triple {2804#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2804#true} is VALID [2022-04-08 10:42:12,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {2804#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2804#true} is VALID [2022-04-08 10:42:12,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {2804#true} call #t~ret6 := main(); {2804#true} is VALID [2022-04-08 10:42:12,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2804#true} {2804#true} #91#return; {2804#true} is VALID [2022-04-08 10:42:12,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-08 10:42:12,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {2804#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(14, 2);call #Ultimate.allocInit(12, 3); {2804#true} is VALID [2022-04-08 10:42:12,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {2804#true} call ULTIMATE.init(); {2804#true} is VALID [2022-04-08 10:42:12,444 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-04-08 10:42:12,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:42:12,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898556205] [2022-04-08 10:42:12,444 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:42:12,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661930521] [2022-04-08 10:42:12,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661930521] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:42:12,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:42:12,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2022-04-08 10:42:12,444 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:42:12,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2038474620] [2022-04-08 10:42:12,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2038474620] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:42:12,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:42:12,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:42:12,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663563997] [2022-04-08 10:42:12,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:42:12,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2022-04-08 10:42:12,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:42:12,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 10:42:12,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:42:12,478 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:42:12,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:42:12,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:42:12,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-08 10:42:12,479 INFO L87 Difference]: Start difference. First operand 75 states and 93 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 10:42:12,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:42:12,736 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2022-04-08 10:42:12,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:42:12,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2022-04-08 10:42:12,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:42:12,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 10:42:12,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 10:42:12,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 10:42:12,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 10:42:12,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-08 10:42:12,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:42:12,777 INFO L225 Difference]: With dead ends: 79 [2022-04-08 10:42:12,777 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 10:42:12,778 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-08 10:42:12,778 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:42:12,778 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 79 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:42:12,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 10:42:12,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 10:42:12,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:42:12,779 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-08 10:42:12,779 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-08 10:42:12,779 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-08 10:42:12,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:42:12,779 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 10:42:12,779 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:42:12,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:42:12,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:42:12,779 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-08 10:42:12,779 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-08 10:42:12,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:42:12,779 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 10:42:12,780 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:42:12,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:42:12,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:42:12,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:42:12,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:42:12,780 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-08 10:42:12,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 10:42:12,780 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2022-04-08 10:42:12,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:42:12,780 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 10:42:12,780 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 10:42:12,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 10:42:12,780 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-08 10:42:12,780 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:42:12,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:42:12,782 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 10:42:12,800 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-08 10:42:12,983 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:42:12,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 10:42:13,566 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-08 10:42:13,566 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-08 10:42:13,566 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-08 10:42:13,566 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-08 10:42:13,566 INFO L878 garLoopResultBuilder]: At program point L12(line 12) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-08 10:42:13,567 INFO L878 garLoopResultBuilder]: At program point L12-2(lines 11 13) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-08 10:42:13,567 INFO L878 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 11 13) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-08 10:42:13,567 INFO L885 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: true [2022-04-08 10:42:13,567 INFO L885 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-08 10:42:13,567 INFO L878 garLoopResultBuilder]: At program point L29-1(line 29) the Hoare annotation is: (<= 1 main_~y~0) [2022-04-08 10:42:13,567 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 22 64) the Hoare annotation is: true [2022-04-08 10:42:13,567 INFO L878 garLoopResultBuilder]: At program point L48(lines 45 57) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-08 10:42:13,567 INFO L878 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-08 10:42:13,567 INFO L878 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-08 10:42:13,567 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 22 64) the Hoare annotation is: true [2022-04-08 10:42:13,567 INFO L878 garLoopResultBuilder]: At program point L38(lines 36 60) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-08 10:42:13,567 INFO L878 garLoopResultBuilder]: At program point L36-2(lines 36 60) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-08 10:42:13,567 INFO L878 garLoopResultBuilder]: At program point L36-3(lines 36 60) the Hoare annotation is: (or (and (= main_~x~0 main_~r~0) (= main_~q~0 0)) (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0)))) [2022-04-08 10:42:13,567 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 22 64) the Hoare annotation is: true [2022-04-08 10:42:13,567 INFO L878 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= (* 2 .cse0) main_~r~0) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 .cse0))) [2022-04-08 10:42:13,567 INFO L878 garLoopResultBuilder]: At program point L53-1(line 53) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= (* 2 .cse0) main_~r~0) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 .cse0))) [2022-04-08 10:42:13,567 INFO L878 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-08 10:42:13,568 INFO L878 garLoopResultBuilder]: At program point L45-2(lines 45 57) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-08 10:42:13,568 INFO L878 garLoopResultBuilder]: At program point L45-3(lines 45 57) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-08 10:42:13,568 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-08 10:42:13,568 INFO L878 garLoopResultBuilder]: At program point L37-1(line 37) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-08 10:42:13,568 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 10:42:13,568 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 10:42:13,568 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 10:42:13,568 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 10:42:13,568 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 10:42:13,568 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 10:42:13,568 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 10:42:13,568 INFO L878 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 10:42:13,568 INFO L878 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-08 10:42:13,568 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-08 10:42:13,568 INFO L878 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-08 10:42:13,568 INFO L878 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-08 10:42:13,568 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 10:42:13,570 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2] [2022-04-08 10:42:13,571 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 10:42:13,573 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 10:42:13,575 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 10:42:13,596 INFO L163 areAnnotationChecker]: CFG has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 10:42:13,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 10:42:13 BoogieIcfgContainer [2022-04-08 10:42:13,609 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 10:42:13,610 INFO L158 Benchmark]: Toolchain (without parser) took 22343.78ms. Allocated memory was 186.6MB in the beginning and 250.6MB in the end (delta: 64.0MB). Free memory was 132.8MB in the beginning and 124.7MB in the end (delta: 8.1MB). Peak memory consumption was 73.1MB. Max. memory is 8.0GB. [2022-04-08 10:42:13,610 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 186.6MB. Free memory was 149.2MB in the beginning and 149.0MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 10:42:13,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.80ms. Allocated memory is still 186.6MB. Free memory was 132.7MB in the beginning and 158.2MB in the end (delta: -25.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 10:42:13,611 INFO L158 Benchmark]: Boogie Preprocessor took 28.17ms. Allocated memory is still 186.6MB. Free memory was 158.2MB in the beginning and 156.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 10:42:13,611 INFO L158 Benchmark]: RCFGBuilder took 242.53ms. Allocated memory is still 186.6MB. Free memory was 156.5MB in the beginning and 145.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 10:42:13,611 INFO L158 Benchmark]: TraceAbstraction took 21873.70ms. Allocated memory was 186.6MB in the beginning and 250.6MB in the end (delta: 64.0MB). Free memory was 144.6MB in the beginning and 124.7MB in the end (delta: 19.9MB). Peak memory consumption was 84.6MB. Max. memory is 8.0GB. [2022-04-08 10:42:13,613 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.14ms. Allocated memory is still 186.6MB. Free memory was 149.2MB in the beginning and 149.0MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 183.80ms. Allocated memory is still 186.6MB. Free memory was 132.7MB in the beginning and 158.2MB in the end (delta: -25.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.17ms. Allocated memory is still 186.6MB. Free memory was 158.2MB in the beginning and 156.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 242.53ms. Allocated memory is still 186.6MB. Free memory was 156.5MB in the beginning and 145.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 21873.70ms. Allocated memory was 186.6MB in the beginning and 250.6MB in the end (delta: 64.0MB). Free memory was 144.6MB in the beginning and 124.7MB in the end (delta: 19.9MB). Peak memory consumption was 84.6MB. 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, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.8s, OverallIterations: 7, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 116 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 735 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 506 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 431 IncrementalHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 229 mSDtfsCounter, 431 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 313 GetRequests, 268 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=6, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 198 PreInvPairs, 292 NumberOfFragments, 328 HoareAnnotationTreeSize, 198 FomulaSimplifications, 88 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 36 FomulaSimplificationsInter, 1196 FormulaSimplificationTreeSizeReductionInter, 0.4s 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: 45]: Loop Invariant Derived loop invariant: ((q * y + r == x && 1 <= r) && 1 <= y) && b == a * y - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (q * y + r == x && 1 <= y) && b == a * y - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - 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-08 10:42:13,641 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...