/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 11:19:09,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 11:19:09,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 11:19:09,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 11:19:09,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 11:19:09,415 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 11:19:09,417 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 11:19:09,420 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 11:19:09,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 11:19:09,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 11:19:09,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 11:19:09,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 11:19:09,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 11:19:09,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 11:19:09,431 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 11:19:09,432 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 11:19:09,432 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 11:19:09,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 11:19:09,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 11:19:09,435 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 11:19:09,436 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 11:19:09,437 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 11:19:09,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 11:19:09,438 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 11:19:09,439 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 11:19:09,441 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 11:19:09,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 11:19:09,442 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 11:19:09,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 11:19:09,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 11:19:09,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 11:19:09,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 11:19:09,444 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 11:19:09,445 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 11:19:09,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 11:19:09,446 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 11:19:09,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 11:19:09,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 11:19:09,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 11:19:09,451 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 11:19:09,452 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 11:19:09,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 11:19:09,454 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 11:19:09,466 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 11:19:09,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 11:19:09,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 11:19:09,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 11:19:09,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 11:19:09,468 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 11:19:09,468 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 11:19:09,468 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 11:19:09,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 11:19:09,469 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 11:19:09,469 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 11:19:09,469 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 11:19:09,469 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 11:19:09,470 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 11:19:09,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 11:19:09,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:19:09,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 11:19:09,470 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 11:19:09,470 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 11:19:09,470 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 11:19:09,470 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 11:19:09,471 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 11:19:09,471 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 11:19:09,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 11:19:09,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 11:19:09,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 11:19:09,736 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 11:19:09,737 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 11:19:09,738 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound1.c [2022-04-28 11:19:09,802 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ff065dd3/f107378358164d588f87c1c5f60ae59b/FLAG73ac8e116 [2022-04-28 11:19:10,173 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 11:19:10,174 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound1.c [2022-04-28 11:19:10,178 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ff065dd3/f107378358164d588f87c1c5f60ae59b/FLAG73ac8e116 [2022-04-28 11:19:10,188 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ff065dd3/f107378358164d588f87c1c5f60ae59b [2022-04-28 11:19:10,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 11:19:10,191 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 11:19:10,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 11:19:10,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 11:19:10,194 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 11:19:10,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:19:10" (1/1) ... [2022-04-28 11:19:10,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@113e9665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:19:10, skipping insertion in model container [2022-04-28 11:19:10,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:19:10" (1/1) ... [2022-04-28 11:19:10,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 11:19:10,217 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 11:19:10,418 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound1.c[576,589] [2022-04-28 11:19:10,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:19:10,461 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 11:19:10,472 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound1.c[576,589] [2022-04-28 11:19:10,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:19:10,508 INFO L208 MainTranslator]: Completed translation [2022-04-28 11:19:10,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:19:10 WrapperNode [2022-04-28 11:19:10,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 11:19:10,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 11:19:10,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 11:19:10,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 11:19:10,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:19:10" (1/1) ... [2022-04-28 11:19:10,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:19:10" (1/1) ... [2022-04-28 11:19:10,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:19:10" (1/1) ... [2022-04-28 11:19:10,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:19:10" (1/1) ... [2022-04-28 11:19:10,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:19:10" (1/1) ... [2022-04-28 11:19:10,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:19:10" (1/1) ... [2022-04-28 11:19:10,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:19:10" (1/1) ... [2022-04-28 11:19:10,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 11:19:10,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 11:19:10,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 11:19:10,555 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 11:19:10,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:19:10" (1/1) ... [2022-04-28 11:19:10,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:19:10,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:10,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 11:19:10,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 11:19:10,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 11:19:10,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 11:19:10,630 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 11:19:10,631 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 11:19:10,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 11:19:10,631 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 11:19:10,632 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 11:19:10,632 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 11:19:10,632 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 11:19:10,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 11:19:10,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 11:19:10,632 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 11:19:10,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 11:19:10,633 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 11:19:10,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 11:19:10,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 11:19:10,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 11:19:10,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 11:19:10,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 11:19:10,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 11:19:10,692 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 11:19:10,693 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 11:19:10,894 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 11:19:10,901 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 11:19:10,901 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 11:19:10,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:19:10 BoogieIcfgContainer [2022-04-28 11:19:10,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 11:19:10,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 11:19:10,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 11:19:10,911 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 11:19:10,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:19:10" (1/3) ... [2022-04-28 11:19:10,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4086e4b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:19:10, skipping insertion in model container [2022-04-28 11:19:10,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:19:10" (2/3) ... [2022-04-28 11:19:10,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4086e4b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:19:10, skipping insertion in model container [2022-04-28 11:19:10,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:19:10" (3/3) ... [2022-04-28 11:19:10,914 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound1.c [2022-04-28 11:19:10,925 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 11:19:10,926 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 11:19:10,962 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 11:19:10,969 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@204de19d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@55beada1 [2022-04-28 11:19:10,969 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 11:19:10,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 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-28 11:19:10,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 11:19:10,982 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:10,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:10,983 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:10,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:10,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1588022502, now seen corresponding path program 1 times [2022-04-28 11:19:10,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:10,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1940484602] [2022-04-28 11:19:11,003 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:19:11,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1588022502, now seen corresponding path program 2 times [2022-04-28 11:19:11,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:11,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092772399] [2022-04-28 11:19:11,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:11,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:11,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:19:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:11,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {41#true} is VALID [2022-04-28 11:19:11,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-28 11:19:11,221 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #93#return; {41#true} is VALID [2022-04-28 11:19:11,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:19:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:11,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 11:19:11,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 11:19:11,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 11:19:11,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #77#return; {42#false} is VALID [2022-04-28 11:19:11,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:19:11,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {41#true} is VALID [2022-04-28 11:19:11,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-28 11:19:11,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #93#return; {41#true} is VALID [2022-04-28 11:19:11,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret8 := main(); {41#true} is VALID [2022-04-28 11:19:11,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#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; {41#true} is VALID [2022-04-28 11:19:11,244 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {41#true} is VALID [2022-04-28 11:19:11,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 11:19:11,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 11:19:11,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 11:19:11,247 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #77#return; {42#false} is VALID [2022-04-28 11:19:11,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {42#false} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {42#false} is VALID [2022-04-28 11:19:11,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#false} assume !true; {42#false} is VALID [2022-04-28 11:19:11,248 INFO L272 TraceCheckUtils]: 13: Hoare triple {42#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {42#false} is VALID [2022-04-28 11:19:11,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-28 11:19:11,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-28 11:19:11,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-28 11:19:11,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:19:11,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:11,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092772399] [2022-04-28 11:19:11,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092772399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:11,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:11,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:19:11,253 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:11,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1940484602] [2022-04-28 11:19:11,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1940484602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:11,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:11,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:19:11,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646257915] [2022-04-28 11:19:11,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:11,261 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-28 11:19:11,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:11,266 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-28 11:19:11,296 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-28 11:19:11,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:19:11,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:11,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:19:11,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:19:11,323 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 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-28 11:19:11,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:11,581 INFO L93 Difference]: Finished difference Result 68 states and 101 transitions. [2022-04-28 11:19:11,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:19:11,581 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-28 11:19:11,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:11,583 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-28 11:19:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 11:19:11,592 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-28 11:19:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 11:19:11,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-28 11:19:11,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:11,745 INFO L225 Difference]: With dead ends: 68 [2022-04-28 11:19:11,746 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 11:19:11,748 INFO L412 NwaCegarLoop]: 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-28 11:19:11,751 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:11,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:19:11,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 11:19:11,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-28 11:19:11,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:11,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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-28 11:19:11,792 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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-28 11:19:11,792 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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-28 11:19:11,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:11,799 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 11:19:11,799 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 11:19:11,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:11,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:11,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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 34 states. [2022-04-28 11:19:11,801 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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 34 states. [2022-04-28 11:19:11,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:11,805 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 11:19:11,805 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 11:19:11,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:11,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:11,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:11,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:11,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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-28 11:19:11,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-04-28 11:19:11,811 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 17 [2022-04-28 11:19:11,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:11,811 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-04-28 11:19:11,812 INFO L496 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-28 11:19:11,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 42 transitions. [2022-04-28 11:19:11,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:11,852 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-04-28 11:19:11,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 11:19:11,852 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:11,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:11,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 11:19:11,853 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:11,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:11,854 INFO L85 PathProgramCache]: Analyzing trace with hash 766070672, now seen corresponding path program 1 times [2022-04-28 11:19:11,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:11,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1024262254] [2022-04-28 11:19:11,854 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:19:11,855 INFO L85 PathProgramCache]: Analyzing trace with hash 766070672, now seen corresponding path program 2 times [2022-04-28 11:19:11,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:11,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549850551] [2022-04-28 11:19:11,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:11,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:11,872 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:11,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [928326675] [2022-04-28 11:19:11,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:19:11,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:11,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:11,879 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:19:11,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 11:19:11,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 11:19:11,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:11,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 11:19:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:11,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:12,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {323#true} call ULTIMATE.init(); {323#true} is VALID [2022-04-28 11:19:12,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {323#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);~counter~0 := 0; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:19:12,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {331#(<= ~counter~0 0)} assume true; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:19:12,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {331#(<= ~counter~0 0)} {323#true} #93#return; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:19:12,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {331#(<= ~counter~0 0)} call #t~ret8 := main(); {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:19:12,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {331#(<= ~counter~0 0)} 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; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:19:12,098 INFO L272 TraceCheckUtils]: 6: Hoare triple {331#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:19:12,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {331#(<= ~counter~0 0)} ~cond := #in~cond; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:19:12,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {331#(<= ~counter~0 0)} assume !(0 == ~cond); {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:19:12,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {331#(<= ~counter~0 0)} assume true; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:19:12,100 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {331#(<= ~counter~0 0)} {331#(<= ~counter~0 0)} #77#return; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:19:12,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {331#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:19:12,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {331#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {365#(<= |main_#t~post6| 0)} is VALID [2022-04-28 11:19:12,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {365#(<= |main_#t~post6| 0)} assume !(#t~post6 < 1);havoc #t~post6; {324#false} is VALID [2022-04-28 11:19:12,102 INFO L272 TraceCheckUtils]: 14: Hoare triple {324#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {324#false} is VALID [2022-04-28 11:19:12,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2022-04-28 11:19:12,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {324#false} assume 0 == ~cond; {324#false} is VALID [2022-04-28 11:19:12,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {324#false} assume !false; {324#false} is VALID [2022-04-28 11:19:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:19:12,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:19:12,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:12,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549850551] [2022-04-28 11:19:12,104 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:12,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928326675] [2022-04-28 11:19:12,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928326675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:12,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:12,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 11:19:12,105 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:12,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1024262254] [2022-04-28 11:19:12,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1024262254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:12,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:12,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 11:19:12,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892421082] [2022-04-28 11:19:12,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:12,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 11:19:12,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:12,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:19:12,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:12,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 11:19:12,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:12,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 11:19:12,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 11:19:12,124 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:19:12,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:12,225 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-28 11:19:12,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 11:19:12,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 11:19:12,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:19:12,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-28 11:19:12,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:19:12,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-28 11:19:12,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2022-04-28 11:19:12,282 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-28 11:19:12,284 INFO L225 Difference]: With dead ends: 42 [2022-04-28 11:19:12,284 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 11:19:12,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 11:19:12,286 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:12,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:19:12,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 11:19:12,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 11:19:12,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:12,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 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-28 11:19:12,362 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 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-28 11:19:12,363 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 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-28 11:19:12,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:12,366 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 11:19:12,366 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:19:12,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:12,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:12,367 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 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 35 states. [2022-04-28 11:19:12,367 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 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 35 states. [2022-04-28 11:19:12,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:12,370 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 11:19:12,370 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:19:12,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:12,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:12,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:12,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:12,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 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-28 11:19:12,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-28 11:19:12,374 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 18 [2022-04-28 11:19:12,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:12,374 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-28 11:19:12,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:19:12,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-28 11:19:12,422 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-28 11:19:12,422 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:19:12,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 11:19:12,423 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:12,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:12,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 11:19:12,639 WARN L477 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-28 11:19:12,640 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:12,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:12,640 INFO L85 PathProgramCache]: Analyzing trace with hash 767560222, now seen corresponding path program 1 times [2022-04-28 11:19:12,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:12,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1754896074] [2022-04-28 11:19:12,641 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:19:12,641 INFO L85 PathProgramCache]: Analyzing trace with hash 767560222, now seen corresponding path program 2 times [2022-04-28 11:19:12,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:12,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851926398] [2022-04-28 11:19:12,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:12,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:12,664 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:12,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1020514546] [2022-04-28 11:19:12,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:19:12,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:12,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:12,666 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:19:12,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 11:19:12,719 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 11:19:12,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:12,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:19:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:12,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:14,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {604#true} call ULTIMATE.init(); {604#true} is VALID [2022-04-28 11:19:14,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {604#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);~counter~0 := 0; {604#true} is VALID [2022-04-28 11:19:14,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-28 11:19:14,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {604#true} {604#true} #93#return; {604#true} is VALID [2022-04-28 11:19:14,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {604#true} call #t~ret8 := main(); {604#true} is VALID [2022-04-28 11:19:14,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {604#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; {604#true} is VALID [2022-04-28 11:19:14,442 INFO L272 TraceCheckUtils]: 6: Hoare triple {604#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {604#true} is VALID [2022-04-28 11:19:14,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {604#true} ~cond := #in~cond; {604#true} is VALID [2022-04-28 11:19:14,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {604#true} assume !(0 == ~cond); {604#true} is VALID [2022-04-28 11:19:14,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-28 11:19:14,442 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {604#true} {604#true} #77#return; {604#true} is VALID [2022-04-28 11:19:14,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {604#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-28 11:19:14,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-28 11:19:14,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} assume !!(#t~post6 < 1);havoc #t~post6; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-28 11:19:14,445 INFO L272 TraceCheckUtils]: 14: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {652#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:14,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {652#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {656#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:14,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {656#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {605#false} is VALID [2022-04-28 11:19:14,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {605#false} assume !false; {605#false} is VALID [2022-04-28 11:19:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:19:14,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:19:14,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:14,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851926398] [2022-04-28 11:19:14,447 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:14,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020514546] [2022-04-28 11:19:14,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020514546] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:14,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:14,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:19:14,448 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:14,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1754896074] [2022-04-28 11:19:14,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1754896074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:14,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:14,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:19:14,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802457130] [2022-04-28 11:19:14,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:14,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 11:19:14,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:14,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:19:14,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:14,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:19:14,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:14,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:19:14,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:19:14,469 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:19:14,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:14,633 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-28 11:19:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:19:14,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 11:19:14,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:14,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:19:14,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-28 11:19:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:19:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-28 11:19:14,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-04-28 11:19:14,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:14,686 INFO L225 Difference]: With dead ends: 45 [2022-04-28 11:19:14,687 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 11:19:14,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:19:14,688 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 145 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-28 11:19:14,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 145 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:19:14,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 11:19:14,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-04-28 11:19:14,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:14,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 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-28 11:19:14,712 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 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-28 11:19:14,713 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 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-28 11:19:14,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:14,716 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-28 11:19:14,716 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-28 11:19:14,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:14,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:14,717 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 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 43 states. [2022-04-28 11:19:14,717 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 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 43 states. [2022-04-28 11:19:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:14,720 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-28 11:19:14,720 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-28 11:19:14,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:14,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:14,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:14,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 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-28 11:19:14,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-28 11:19:14,723 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 18 [2022-04-28 11:19:14,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:14,724 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-28 11:19:14,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:19:14,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 49 transitions. [2022-04-28 11:19:14,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:14,767 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-28 11:19:14,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 11:19:14,768 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:14,768 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:14,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 11:19:14,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 11:19:14,974 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:14,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:14,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1016228092, now seen corresponding path program 1 times [2022-04-28 11:19:14,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:14,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [390979296] [2022-04-28 11:19:14,975 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:19:14,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1016228092, now seen corresponding path program 2 times [2022-04-28 11:19:14,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:14,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191748280] [2022-04-28 11:19:14,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:14,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:14,997 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:14,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1735596139] [2022-04-28 11:19:14,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:19:14,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:14,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:15,000 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:19:15,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 11:19:15,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:19:15,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:15,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:19:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:15,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:17,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {920#true} call ULTIMATE.init(); {920#true} is VALID [2022-04-28 11:19:17,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {920#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);~counter~0 := 0; {920#true} is VALID [2022-04-28 11:19:17,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-28 11:19:17,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {920#true} {920#true} #93#return; {920#true} is VALID [2022-04-28 11:19:17,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {920#true} call #t~ret8 := main(); {920#true} is VALID [2022-04-28 11:19:17,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {920#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; {920#true} is VALID [2022-04-28 11:19:17,264 INFO L272 TraceCheckUtils]: 6: Hoare triple {920#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {920#true} is VALID [2022-04-28 11:19:17,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {920#true} ~cond := #in~cond; {920#true} is VALID [2022-04-28 11:19:17,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {920#true} assume !(0 == ~cond); {920#true} is VALID [2022-04-28 11:19:17,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-28 11:19:17,264 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {920#true} {920#true} #77#return; {920#true} is VALID [2022-04-28 11:19:17,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {920#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:19:17,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:19:17,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 1);havoc #t~post6; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:19:17,269 INFO L272 TraceCheckUtils]: 14: Hoare triple {958#(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)); {920#true} is VALID [2022-04-28 11:19:17,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#true} ~cond := #in~cond; {920#true} is VALID [2022-04-28 11:19:17,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {920#true} assume !(0 == ~cond); {920#true} is VALID [2022-04-28 11:19:17,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-28 11:19:17,273 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {920#true} {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:19:17,274 INFO L272 TraceCheckUtils]: 19: Hoare triple {958#(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)); {983#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:17,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {983#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {987#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:17,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {987#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {921#false} is VALID [2022-04-28 11:19:17,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {921#false} assume !false; {921#false} is VALID [2022-04-28 11:19:17,275 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-28 11:19:17,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:19:17,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:17,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191748280] [2022-04-28 11:19:17,276 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:17,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735596139] [2022-04-28 11:19:17,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735596139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:17,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:17,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:19:17,277 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:17,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [390979296] [2022-04-28 11:19:17,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [390979296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:17,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:17,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:19:17,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007129014] [2022-04-28 11:19:17,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:17,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 23 [2022-04-28 11:19:17,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:17,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-28 11:19:17,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:17,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:19:17,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:17,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:19:17,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:19:17,305 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-28 11:19:17,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:17,578 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-04-28 11:19:17,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:19:17,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 23 [2022-04-28 11:19:17,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:17,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-28 11:19:17,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-28 11:19:17,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-28 11:19:17,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-28 11:19:17,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-28 11:19:17,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:17,654 INFO L225 Difference]: With dead ends: 58 [2022-04-28 11:19:17,654 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 11:19:17,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:19:17,656 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 139 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:17,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 139 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:19:17,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 11:19:17,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-28 11:19:17,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:17,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 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-28 11:19:17,683 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 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-28 11:19:17,685 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 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-28 11:19:17,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:17,693 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-28 11:19:17,693 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-28 11:19:17,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:17,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:17,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 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 55 states. [2022-04-28 11:19:17,699 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 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 55 states. [2022-04-28 11:19:17,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:17,701 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-28 11:19:17,702 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-28 11:19:17,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:17,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:17,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:17,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 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-28 11:19:17,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-04-28 11:19:17,705 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 23 [2022-04-28 11:19:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:17,705 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-04-28 11:19:17,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-28 11:19:17,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 69 transitions. [2022-04-28 11:19:17,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:17,782 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-28 11:19:17,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 11:19:17,784 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:17,784 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-04-28 11:19:17,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 11:19:17,991 WARN L477 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-28 11:19:17,992 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:17,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:17,992 INFO L85 PathProgramCache]: Analyzing trace with hash 2019703110, now seen corresponding path program 1 times [2022-04-28 11:19:17,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:17,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [530849937] [2022-04-28 11:19:17,993 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:19:17,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2019703110, now seen corresponding path program 2 times [2022-04-28 11:19:17,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:17,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041038104] [2022-04-28 11:19:17,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:17,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:18,008 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:18,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [553332641] [2022-04-28 11:19:18,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:19:18,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:18,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:18,010 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:19:18,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 11:19:18,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:19:18,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:18,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:19:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:18,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:18,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {1329#true} call ULTIMATE.init(); {1329#true} is VALID [2022-04-28 11:19:18,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {1329#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);~counter~0 := 0; {1337#(<= 0 ~counter~0)} is VALID [2022-04-28 11:19:18,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {1337#(<= 0 ~counter~0)} assume true; {1337#(<= 0 ~counter~0)} is VALID [2022-04-28 11:19:18,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1337#(<= 0 ~counter~0)} {1329#true} #93#return; {1337#(<= 0 ~counter~0)} is VALID [2022-04-28 11:19:18,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {1337#(<= 0 ~counter~0)} call #t~ret8 := main(); {1337#(<= 0 ~counter~0)} is VALID [2022-04-28 11:19:18,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {1337#(<= 0 ~counter~0)} 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; {1337#(<= 0 ~counter~0)} is VALID [2022-04-28 11:19:18,216 INFO L272 TraceCheckUtils]: 6: Hoare triple {1337#(<= 0 ~counter~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1337#(<= 0 ~counter~0)} is VALID [2022-04-28 11:19:18,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {1337#(<= 0 ~counter~0)} ~cond := #in~cond; {1337#(<= 0 ~counter~0)} is VALID [2022-04-28 11:19:18,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {1337#(<= 0 ~counter~0)} assume !(0 == ~cond); {1337#(<= 0 ~counter~0)} is VALID [2022-04-28 11:19:18,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {1337#(<= 0 ~counter~0)} assume true; {1337#(<= 0 ~counter~0)} is VALID [2022-04-28 11:19:18,218 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1337#(<= 0 ~counter~0)} {1337#(<= 0 ~counter~0)} #77#return; {1337#(<= 0 ~counter~0)} is VALID [2022-04-28 11:19:18,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {1337#(<= 0 ~counter~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1337#(<= 0 ~counter~0)} is VALID [2022-04-28 11:19:18,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {1337#(<= 0 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1371#(<= 1 ~counter~0)} is VALID [2022-04-28 11:19:18,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {1371#(<= 1 ~counter~0)} assume !!(#t~post6 < 1);havoc #t~post6; {1371#(<= 1 ~counter~0)} is VALID [2022-04-28 11:19:18,220 INFO L272 TraceCheckUtils]: 14: Hoare triple {1371#(<= 1 ~counter~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1371#(<= 1 ~counter~0)} is VALID [2022-04-28 11:19:18,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {1371#(<= 1 ~counter~0)} ~cond := #in~cond; {1371#(<= 1 ~counter~0)} is VALID [2022-04-28 11:19:18,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {1371#(<= 1 ~counter~0)} assume !(0 == ~cond); {1371#(<= 1 ~counter~0)} is VALID [2022-04-28 11:19:18,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {1371#(<= 1 ~counter~0)} assume true; {1371#(<= 1 ~counter~0)} is VALID [2022-04-28 11:19:18,222 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1371#(<= 1 ~counter~0)} {1371#(<= 1 ~counter~0)} #79#return; {1371#(<= 1 ~counter~0)} is VALID [2022-04-28 11:19:18,224 INFO L272 TraceCheckUtils]: 19: Hoare triple {1371#(<= 1 ~counter~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1371#(<= 1 ~counter~0)} is VALID [2022-04-28 11:19:18,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {1371#(<= 1 ~counter~0)} ~cond := #in~cond; {1371#(<= 1 ~counter~0)} is VALID [2022-04-28 11:19:18,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {1371#(<= 1 ~counter~0)} assume !(0 == ~cond); {1371#(<= 1 ~counter~0)} is VALID [2022-04-28 11:19:18,225 INFO L290 TraceCheckUtils]: 22: Hoare triple {1371#(<= 1 ~counter~0)} assume true; {1371#(<= 1 ~counter~0)} is VALID [2022-04-28 11:19:18,226 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1371#(<= 1 ~counter~0)} {1371#(<= 1 ~counter~0)} #81#return; {1371#(<= 1 ~counter~0)} is VALID [2022-04-28 11:19:18,226 INFO L290 TraceCheckUtils]: 24: Hoare triple {1371#(<= 1 ~counter~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1371#(<= 1 ~counter~0)} is VALID [2022-04-28 11:19:18,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {1371#(<= 1 ~counter~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1411#(<= 1 |main_#t~post7|)} is VALID [2022-04-28 11:19:18,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {1411#(<= 1 |main_#t~post7|)} assume !!(#t~post7 < 1);havoc #t~post7; {1330#false} is VALID [2022-04-28 11:19:18,227 INFO L272 TraceCheckUtils]: 27: Hoare triple {1330#false} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1330#false} is VALID [2022-04-28 11:19:18,228 INFO L290 TraceCheckUtils]: 28: Hoare triple {1330#false} ~cond := #in~cond; {1330#false} is VALID [2022-04-28 11:19:18,228 INFO L290 TraceCheckUtils]: 29: Hoare triple {1330#false} assume 0 == ~cond; {1330#false} is VALID [2022-04-28 11:19:18,228 INFO L290 TraceCheckUtils]: 30: Hoare triple {1330#false} assume !false; {1330#false} is VALID [2022-04-28 11:19:18,228 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-28 11:19:18,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:19:18,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:18,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041038104] [2022-04-28 11:19:18,229 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:18,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553332641] [2022-04-28 11:19:18,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553332641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:18,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:18,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:19:18,229 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:18,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [530849937] [2022-04-28 11:19:18,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [530849937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:18,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:18,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:19:18,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177880693] [2022-04-28 11:19:18,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:18,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2022-04-28 11:19:18,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:18,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:19:18,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:18,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:19:18,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:18,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:19:18,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:19:18,254 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:19:18,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:18,384 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2022-04-28 11:19:18,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:19:18,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2022-04-28 11:19:18,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:18,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:19:18,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-04-28 11:19:18,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:19:18,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-04-28 11:19:18,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2022-04-28 11:19:18,434 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-28 11:19:18,435 INFO L225 Difference]: With dead ends: 75 [2022-04-28 11:19:18,435 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 11:19:18,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:19:18,437 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:18,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 62 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:19:18,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 11:19:18,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2022-04-28 11:19:18,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:18,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 40 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 11:19:18,475 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 40 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 11:19:18,475 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 40 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 11:19:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:18,477 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-04-28 11:19:18,477 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-04-28 11:19:18,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:18,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:18,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 42 states. [2022-04-28 11:19:18,478 INFO L87 Difference]: Start difference. First operand has 40 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 42 states. [2022-04-28 11:19:18,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:18,479 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-04-28 11:19:18,480 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-04-28 11:19:18,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:18,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:18,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:18,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:18,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 11:19:18,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-28 11:19:18,482 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 31 [2022-04-28 11:19:18,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:18,482 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-28 11:19:18,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:19:18,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 43 transitions. [2022-04-28 11:19:18,522 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-28 11:19:18,522 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-28 11:19:18,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 11:19:18,523 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:18,523 INFO L195 NwaCegarLoop]: trace histogram [3, 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-28 11:19:18,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 11:19:18,744 WARN L477 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-28 11:19:18,744 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:18,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:18,745 INFO L85 PathProgramCache]: Analyzing trace with hash 202176206, now seen corresponding path program 1 times [2022-04-28 11:19:18,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:18,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [903938747] [2022-04-28 11:19:25,381 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:19:25,382 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:19:25,382 INFO L85 PathProgramCache]: Analyzing trace with hash 202176206, now seen corresponding path program 2 times [2022-04-28 11:19:25,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:25,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505467951] [2022-04-28 11:19:25,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:25,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:25,395 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:25,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [717948617] [2022-04-28 11:19:25,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:19:25,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:25,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:25,400 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:19:25,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 11:19:25,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:19:25,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:25,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:19:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:25,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:25,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {1742#true} call ULTIMATE.init(); {1742#true} is VALID [2022-04-28 11:19:25,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {1742#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);~counter~0 := 0; {1742#true} is VALID [2022-04-28 11:19:25,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {1742#true} assume true; {1742#true} is VALID [2022-04-28 11:19:25,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1742#true} {1742#true} #93#return; {1742#true} is VALID [2022-04-28 11:19:25,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {1742#true} call #t~ret8 := main(); {1742#true} is VALID [2022-04-28 11:19:25,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {1742#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; {1742#true} is VALID [2022-04-28 11:19:25,675 INFO L272 TraceCheckUtils]: 6: Hoare triple {1742#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1742#true} is VALID [2022-04-28 11:19:25,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {1742#true} ~cond := #in~cond; {1742#true} is VALID [2022-04-28 11:19:25,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {1742#true} assume !(0 == ~cond); {1742#true} is VALID [2022-04-28 11:19:25,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {1742#true} assume true; {1742#true} is VALID [2022-04-28 11:19:25,676 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1742#true} {1742#true} #77#return; {1742#true} is VALID [2022-04-28 11:19:25,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {1742#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1780#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:19:25,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {1780#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1780#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:19:25,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {1780#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 1);havoc #t~post6; {1780#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:19:25,685 INFO L272 TraceCheckUtils]: 14: Hoare triple {1780#(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)); {1742#true} is VALID [2022-04-28 11:19:25,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {1742#true} ~cond := #in~cond; {1742#true} is VALID [2022-04-28 11:19:25,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {1742#true} assume !(0 == ~cond); {1742#true} is VALID [2022-04-28 11:19:25,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {1742#true} assume true; {1742#true} is VALID [2022-04-28 11:19:25,686 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1742#true} {1780#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {1780#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:19:25,687 INFO L272 TraceCheckUtils]: 19: Hoare triple {1780#(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)); {1742#true} is VALID [2022-04-28 11:19:25,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {1742#true} ~cond := #in~cond; {1742#true} is VALID [2022-04-28 11:19:25,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {1742#true} assume !(0 == ~cond); {1742#true} is VALID [2022-04-28 11:19:25,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {1742#true} assume true; {1742#true} is VALID [2022-04-28 11:19:25,688 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1742#true} {1780#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {1780#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:19:25,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {1780#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1820#(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-28 11:19:25,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {1820#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1820#(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-28 11:19:25,689 INFO L290 TraceCheckUtils]: 26: Hoare triple {1820#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !(#t~post7 < 1);havoc #t~post7; {1820#(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-28 11:19:25,690 INFO L290 TraceCheckUtils]: 27: Hoare triple {1820#(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; {1830#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-28 11:19:25,691 INFO L290 TraceCheckUtils]: 28: Hoare triple {1830#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1830#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-28 11:19:25,691 INFO L290 TraceCheckUtils]: 29: Hoare triple {1830#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} assume !(#t~post6 < 1);havoc #t~post6; {1830#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-28 11:19:25,692 INFO L272 TraceCheckUtils]: 30: Hoare triple {1830#(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)); {1840#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:25,693 INFO L290 TraceCheckUtils]: 31: Hoare triple {1840#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1844#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:25,693 INFO L290 TraceCheckUtils]: 32: Hoare triple {1844#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1743#false} is VALID [2022-04-28 11:19:25,693 INFO L290 TraceCheckUtils]: 33: Hoare triple {1743#false} assume !false; {1743#false} is VALID [2022-04-28 11:19:25,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 11:19:25,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:19:44,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {1743#false} assume !false; {1743#false} is VALID [2022-04-28 11:19:44,799 INFO L290 TraceCheckUtils]: 32: Hoare triple {1844#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1743#false} is VALID [2022-04-28 11:19:44,799 INFO L290 TraceCheckUtils]: 31: Hoare triple {1840#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1844#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:44,800 INFO L272 TraceCheckUtils]: 30: Hoare triple {1860#(= (+ (* 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)); {1840#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:44,800 INFO L290 TraceCheckUtils]: 29: Hoare triple {1860#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !(#t~post6 < 1);havoc #t~post6; {1860#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:19:44,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {1860#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1860#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:19:44,821 INFO L290 TraceCheckUtils]: 27: Hoare triple {1870#(= 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; {1860#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:19:44,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {1870#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !(#t~post7 < 1);havoc #t~post7; {1870#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:19:44,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {1870#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1870#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:19:44,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {1780#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1870#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:19:44,824 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1742#true} {1780#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {1780#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:19:44,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {1742#true} assume true; {1742#true} is VALID [2022-04-28 11:19:44,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {1742#true} assume !(0 == ~cond); {1742#true} is VALID [2022-04-28 11:19:44,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {1742#true} ~cond := #in~cond; {1742#true} is VALID [2022-04-28 11:19:44,825 INFO L272 TraceCheckUtils]: 19: Hoare triple {1780#(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)); {1742#true} is VALID [2022-04-28 11:19:44,825 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1742#true} {1780#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {1780#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:19:44,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {1742#true} assume true; {1742#true} is VALID [2022-04-28 11:19:44,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {1742#true} assume !(0 == ~cond); {1742#true} is VALID [2022-04-28 11:19:44,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {1742#true} ~cond := #in~cond; {1742#true} is VALID [2022-04-28 11:19:44,826 INFO L272 TraceCheckUtils]: 14: Hoare triple {1780#(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)); {1742#true} is VALID [2022-04-28 11:19:44,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {1780#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 1);havoc #t~post6; {1780#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:19:44,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {1780#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1780#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:19:44,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {1742#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1780#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:19:44,828 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1742#true} {1742#true} #77#return; {1742#true} is VALID [2022-04-28 11:19:44,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {1742#true} assume true; {1742#true} is VALID [2022-04-28 11:19:44,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {1742#true} assume !(0 == ~cond); {1742#true} is VALID [2022-04-28 11:19:44,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {1742#true} ~cond := #in~cond; {1742#true} is VALID [2022-04-28 11:19:44,828 INFO L272 TraceCheckUtils]: 6: Hoare triple {1742#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1742#true} is VALID [2022-04-28 11:19:44,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {1742#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; {1742#true} is VALID [2022-04-28 11:19:44,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {1742#true} call #t~ret8 := main(); {1742#true} is VALID [2022-04-28 11:19:44,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1742#true} {1742#true} #93#return; {1742#true} is VALID [2022-04-28 11:19:44,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {1742#true} assume true; {1742#true} is VALID [2022-04-28 11:19:44,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {1742#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);~counter~0 := 0; {1742#true} is VALID [2022-04-28 11:19:44,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {1742#true} call ULTIMATE.init(); {1742#true} is VALID [2022-04-28 11:19:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 11:19:44,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:44,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505467951] [2022-04-28 11:19:44,830 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:44,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717948617] [2022-04-28 11:19:44,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717948617] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:19:44,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:19:44,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 11:19:44,831 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:44,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [903938747] [2022-04-28 11:19:44,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [903938747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:44,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:44,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:19:44,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647599912] [2022-04-28 11:19:44,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:44,832 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-28 11:19:44,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:44,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:19:44,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:44,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:19:44,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:44,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:19:44,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:19:44,864 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:19:45,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:45,214 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-04-28 11:19:45,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:19:45,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-28 11:19:45,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:45,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:19:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-28 11:19:45,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:19:45,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-28 11:19:45,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2022-04-28 11:19:45,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:45,276 INFO L225 Difference]: With dead ends: 58 [2022-04-28 11:19:45,276 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 11:19:45,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:19:45,277 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 13 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:45,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 163 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:19:45,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 11:19:45,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2022-04-28 11:19:45,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:45,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 52 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:19:45,334 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 52 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:19:45,334 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 52 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:19:45,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:45,337 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-04-28 11:19:45,337 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-04-28 11:19:45,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:45,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:45,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 55 states. [2022-04-28 11:19:45,339 INFO L87 Difference]: Start difference. First operand has 52 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 55 states. [2022-04-28 11:19:45,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:45,343 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-04-28 11:19:45,343 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-04-28 11:19:45,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:45,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:45,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:45,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:45,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:19:45,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-04-28 11:19:45,346 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 34 [2022-04-28 11:19:45,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:45,346 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-04-28 11:19:45,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:19:45,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 56 transitions. [2022-04-28 11:19:45,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:45,411 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-28 11:19:45,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 11:19:45,413 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:45,414 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 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] [2022-04-28 11:19:45,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 11:19:45,632 WARN L477 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-28 11:19:45,633 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:45,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:45,633 INFO L85 PathProgramCache]: Analyzing trace with hash 203665756, now seen corresponding path program 1 times [2022-04-28 11:19:45,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:45,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1648701295] [2022-04-28 11:19:53,812 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:19:53,812 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:19:53,813 INFO L85 PathProgramCache]: Analyzing trace with hash 203665756, now seen corresponding path program 2 times [2022-04-28 11:19:53,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:53,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144410752] [2022-04-28 11:19:53,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:53,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:53,833 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:53,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [517863309] [2022-04-28 11:19:53,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:19:53,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:53,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:53,838 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:19:53,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 11:19:53,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:19:53,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:53,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 11:19:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:53,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:54,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {2286#true} call ULTIMATE.init(); {2286#true} is VALID [2022-04-28 11:19:54,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {2286#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);~counter~0 := 0; {2286#true} is VALID [2022-04-28 11:19:54,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {2286#true} assume true; {2286#true} is VALID [2022-04-28 11:19:54,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2286#true} {2286#true} #93#return; {2286#true} is VALID [2022-04-28 11:19:54,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {2286#true} call #t~ret8 := main(); {2286#true} is VALID [2022-04-28 11:19:54,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {2286#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; {2286#true} is VALID [2022-04-28 11:19:54,018 INFO L272 TraceCheckUtils]: 6: Hoare triple {2286#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2286#true} is VALID [2022-04-28 11:19:54,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {2286#true} ~cond := #in~cond; {2286#true} is VALID [2022-04-28 11:19:54,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {2286#true} assume !(0 == ~cond); {2286#true} is VALID [2022-04-28 11:19:54,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {2286#true} assume true; {2286#true} is VALID [2022-04-28 11:19:54,018 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2286#true} {2286#true} #77#return; {2286#true} is VALID [2022-04-28 11:19:54,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {2286#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2286#true} is VALID [2022-04-28 11:19:54,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {2286#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2286#true} is VALID [2022-04-28 11:19:54,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {2286#true} assume !!(#t~post6 < 1);havoc #t~post6; {2286#true} is VALID [2022-04-28 11:19:54,019 INFO L272 TraceCheckUtils]: 14: Hoare triple {2286#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2286#true} is VALID [2022-04-28 11:19:54,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {2286#true} ~cond := #in~cond; {2286#true} is VALID [2022-04-28 11:19:54,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {2286#true} assume !(0 == ~cond); {2286#true} is VALID [2022-04-28 11:19:54,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {2286#true} assume true; {2286#true} is VALID [2022-04-28 11:19:54,019 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2286#true} {2286#true} #79#return; {2286#true} is VALID [2022-04-28 11:19:54,019 INFO L272 TraceCheckUtils]: 19: Hoare triple {2286#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2286#true} is VALID [2022-04-28 11:19:54,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {2286#true} ~cond := #in~cond; {2286#true} is VALID [2022-04-28 11:19:54,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {2286#true} assume !(0 == ~cond); {2286#true} is VALID [2022-04-28 11:19:54,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {2286#true} assume true; {2286#true} is VALID [2022-04-28 11:19:54,020 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2286#true} {2286#true} #81#return; {2286#true} is VALID [2022-04-28 11:19:54,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {2286#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2286#true} is VALID [2022-04-28 11:19:54,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {2286#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2366#(<= (+ |main_#t~post7| 1) ~counter~0)} is VALID [2022-04-28 11:19:54,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {2366#(<= (+ |main_#t~post7| 1) ~counter~0)} assume !(#t~post7 < 1);havoc #t~post7; {2370#(<= 2 ~counter~0)} is VALID [2022-04-28 11:19:54,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {2370#(<= 2 ~counter~0)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {2370#(<= 2 ~counter~0)} is VALID [2022-04-28 11:19:54,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {2370#(<= 2 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2377#(<= 2 |main_#t~post6|)} is VALID [2022-04-28 11:19:54,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {2377#(<= 2 |main_#t~post6|)} assume !!(#t~post6 < 1);havoc #t~post6; {2287#false} is VALID [2022-04-28 11:19:54,023 INFO L272 TraceCheckUtils]: 30: Hoare triple {2287#false} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2287#false} is VALID [2022-04-28 11:19:54,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {2287#false} ~cond := #in~cond; {2287#false} is VALID [2022-04-28 11:19:54,023 INFO L290 TraceCheckUtils]: 32: Hoare triple {2287#false} assume 0 == ~cond; {2287#false} is VALID [2022-04-28 11:19:54,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {2287#false} assume !false; {2287#false} is VALID [2022-04-28 11:19:54,023 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 11:19:54,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:19:54,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:54,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144410752] [2022-04-28 11:19:54,024 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:54,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517863309] [2022-04-28 11:19:54,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517863309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:54,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:54,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:19:54,024 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:54,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1648701295] [2022-04-28 11:19:54,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1648701295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:54,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:54,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:19:54,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032097614] [2022-04-28 11:19:54,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:54,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 34 [2022-04-28 11:19:54,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:54,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-28 11:19:54,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:54,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:19:54,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:54,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:19:54,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:19:54,047 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-28 11:19:54,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:54,137 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-28 11:19:54,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:19:54,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 34 [2022-04-28 11:19:54,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:54,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-28 11:19:54,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-28 11:19:54,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-28 11:19:54,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-28 11:19:54,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-04-28 11:19:54,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:54,181 INFO L225 Difference]: With dead ends: 52 [2022-04-28 11:19:54,181 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 11:19:54,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:19:54,186 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:54,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:19:54,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 11:19:54,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 11:19:54,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:54,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:19:54,188 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:19:54,188 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:19:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:54,189 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:19:54,189 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:19:54,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:54,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:54,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 11:19:54,189 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 11:19:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:54,189 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:19:54,190 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:19:54,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:54,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:54,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:54,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:54,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:19:54,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 11:19:54,190 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2022-04-28 11:19:54,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:54,190 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 11:19:54,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-28 11:19:54,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 11:19:54,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:54,191 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:19:54,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:54,193 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 11:19:54,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 11:19:54,403 WARN L477 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-28 11:19:54,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 11:19:54,797 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-28 11:19:54,797 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-28 11:19:54,797 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-28 11:19:54,798 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-28 11:19:54,798 INFO L902 garLoopResultBuilder]: At program point L12(line 12) the Hoare annotation is: true [2022-04-28 11:19:54,798 INFO L902 garLoopResultBuilder]: At program point L12-2(lines 11 13) the Hoare annotation is: true [2022-04-28 11:19:54,798 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 11 13) the Hoare annotation is: true [2022-04-28 11:19:54,798 INFO L895 garLoopResultBuilder]: At program point L37-4(lines 37 61) the Hoare annotation is: (or (and (<= 1 ~counter~0) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1)) (not (<= |old(~counter~0)| 0)) (and (= main_~x~0 main_~r~0) (= main_~q~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:19:54,798 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 23 65) the Hoare annotation is: true [2022-04-28 11:19:54,798 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:19:54,798 INFO L895 garLoopResultBuilder]: At program point L54-1(line 54) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:19:54,798 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:19:54,798 INFO L895 garLoopResultBuilder]: At program point L46-1(lines 46 58) the Hoare annotation is: (or (and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= (+ |main_#t~post7| 1) ~counter~0) (<= 1 |main_#t~post7|) (= main_~b~0 main_~y~0) (= main_~q~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:19:54,798 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 23 65) the Hoare annotation is: true [2022-04-28 11:19:54,799 INFO L895 garLoopResultBuilder]: At program point L46-3(lines 46 58) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= 1 ~counter~0) (= main_~b~0 main_~y~0) (= main_~q~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:19:54,799 INFO L895 garLoopResultBuilder]: At program point L46-4(lines 46 58) the Hoare annotation is: (or (and (<= 2 ~counter~0) (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:19:54,799 INFO L895 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~a~0 0) (= main_~x~0 main_~r~0) (= main_~b~0 0) (<= 1 ~counter~0) (= main_~q~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:19:54,799 INFO L895 garLoopResultBuilder]: At program point L38-1(line 38) the Hoare annotation is: (or (and (= main_~x~0 main_~r~0) (<= 1 ~counter~0) (= main_~q~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:19:54,799 INFO L902 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: true [2022-04-28 11:19:54,799 INFO L895 garLoopResultBuilder]: At program point L30(line 30) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:19:54,799 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 23 65) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:19:54,799 INFO L895 garLoopResultBuilder]: At program point L30-1(line 30) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:19:54,799 INFO L895 garLoopResultBuilder]: At program point L49(lines 46 58) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:19:54,799 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:19:54,800 INFO L895 garLoopResultBuilder]: At program point L47-1(line 47) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:19:54,800 INFO L895 garLoopResultBuilder]: At program point L39(lines 37 61) the Hoare annotation is: (or (and (= main_~x~0 main_~r~0) (<= 1 ~counter~0) (= main_~q~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:19:54,800 INFO L895 garLoopResultBuilder]: At program point L37-1(lines 37 61) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~a~0 0) (= main_~x~0 main_~r~0) (= main_~b~0 0) (<= 1 ~counter~0) (<= |main_#t~post6| 0) (= main_~q~0 0)) (and (<= 2 ~counter~0) (<= 2 |main_#t~post6|) (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:19:54,800 INFO L895 garLoopResultBuilder]: At program point L37-3(lines 37 61) the Hoare annotation is: (or (and (= main_~a~0 0) (= main_~x~0 main_~r~0) (= main_~b~0 0) (<= 0 ~counter~0) (<= ~counter~0 0) (= main_~q~0 0)) (not (<= |old(~counter~0)| 0)) (and (<= 2 ~counter~0) (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:19:54,800 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-28 11:19:54,800 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 11:19:54,800 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-28 11:19:54,800 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 11:19:54,800 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-28 11:19:54,800 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 11:19:54,800 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 11:19:54,801 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 11:19:54,803 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 11:19:54,803 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-28 11:19:54,803 INFO L895 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (not (<= 1 ~counter~0)) (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 11:19:54,803 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (not (<= 1 ~counter~0)) (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 11:19:54,804 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 11:19:54,806 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2] [2022-04-28 11:19:54,808 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 11:19:54,811 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 11:19:54,814 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 11:19:54,846 INFO L163 areAnnotationChecker]: CFG has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 11:19:54,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 11:19:54 BoogieIcfgContainer [2022-04-28 11:19:54,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 11:19:54,857 INFO L158 Benchmark]: Toolchain (without parser) took 44666.38ms. Allocated memory was 179.3MB in the beginning and 239.1MB in the end (delta: 59.8MB). Free memory was 127.5MB in the beginning and 149.6MB in the end (delta: -22.1MB). Peak memory consumption was 37.5MB. Max. memory is 8.0GB. [2022-04-28 11:19:54,857 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 179.3MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 11:19:54,858 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.29ms. Allocated memory was 179.3MB in the beginning and 239.1MB in the end (delta: 59.8MB). Free memory was 127.2MB in the beginning and 215.3MB in the end (delta: -88.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-04-28 11:19:54,858 INFO L158 Benchmark]: Boogie Preprocessor took 44.12ms. Allocated memory is still 239.1MB. Free memory was 214.8MB in the beginning and 213.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 11:19:54,858 INFO L158 Benchmark]: RCFGBuilder took 347.82ms. Allocated memory is still 239.1MB. Free memory was 213.2MB in the beginning and 201.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 11:19:54,858 INFO L158 Benchmark]: TraceAbstraction took 43952.37ms. Allocated memory is still 239.1MB. Free memory was 200.1MB in the beginning and 149.6MB in the end (delta: 50.5MB). Peak memory consumption was 51.0MB. Max. memory is 8.0GB. [2022-04-28 11:19:54,859 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 179.3MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 317.29ms. Allocated memory was 179.3MB in the beginning and 239.1MB in the end (delta: 59.8MB). Free memory was 127.2MB in the beginning and 215.3MB in the end (delta: -88.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.12ms. Allocated memory is still 239.1MB. Free memory was 214.8MB in the beginning and 213.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 347.82ms. Allocated memory is still 239.1MB. Free memory was 213.2MB in the beginning and 201.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 43952.37ms. Allocated memory is still 239.1MB. Free memory was 200.1MB in the beginning and 149.6MB in the end (delta: 50.5MB). Peak memory consumption was 51.0MB. 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, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.9s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 63 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 752 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 497 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 217 IncrementalHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 255 mSDtfsCounter, 217 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 169 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=4, InterpolantAutomatonStates: 34, 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, 10 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 38 LocationsWithAnnotation, 200 PreInvPairs, 242 NumberOfFragments, 440 HoareAnnotationTreeSize, 200 FomulaSimplifications, 24 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 38 FomulaSimplificationsInter, 160 FormulaSimplificationTreeSizeReductionInter, 0.3s 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: 46]: Loop Invariant Derived loop invariant: (!(\old(counter) <= 0) || ((((a == 1 && x == r) && 1 <= counter) && b == y) && q == 0)) || !(0 <= \old(counter)) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (((((((a == 0 && x == r) && b == 0) && 0 <= counter) && counter <= 0) && q == 0) || !(\old(counter) <= 0)) || ((2 <= counter && x == y + r) && q == 1)) || !(0 <= \old(counter)) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 23]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (!(1 <= counter) || !(1 <= \old(cond))) || 1 <= cond RESULT: Ultimate proved your program to be correct! [2022-04-28 11:19:54,877 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...