/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/reducercommutativity/rangesum20.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 00:07:22,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 00:07:22,398 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 00:07:22,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 00:07:22,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 00:07:22,430 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 00:07:22,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 00:07:22,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 00:07:22,431 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 00:07:22,435 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 00:07:22,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 00:07:22,436 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 00:07:22,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 00:07:22,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 00:07:22,438 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 00:07:22,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 00:07:22,438 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 00:07:22,439 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 00:07:22,439 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 00:07:22,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 00:07:22,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 00:07:22,440 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 00:07:22,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 00:07:22,440 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 00:07:22,441 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 00:07:22,441 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 00:07:22,441 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 00:07:22,441 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 00:07:22,442 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 00:07:22,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 00:07:22,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 00:07:22,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 00:07:22,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 00:07:22,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 00:07:22,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 00:07:22,444 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 00:07:22,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 00:07:22,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 00:07:22,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 00:07:22,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 00:07:22,445 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 00:07:22,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 00:07:22,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 00:07:22,446 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 00:07:22,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 00:07:22,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 00:07:22,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 00:07:22,688 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 00:07:22,688 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 00:07:22,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/rangesum20.i [2023-12-16 00:07:23,917 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 00:07:24,140 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 00:07:24,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum20.i [2023-12-16 00:07:24,149 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d09a7bc8/a829657aa95848f9b6159b43a9751965/FLAGe110f4cda [2023-12-16 00:07:24,166 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d09a7bc8/a829657aa95848f9b6159b43a9751965 [2023-12-16 00:07:24,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 00:07:24,169 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 00:07:24,172 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 00:07:24,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 00:07:24,177 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 00:07:24,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:07:24" (1/1) ... [2023-12-16 00:07:24,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@758fff2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:07:24, skipping insertion in model container [2023-12-16 00:07:24,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:07:24" (1/1) ... [2023-12-16 00:07:24,202 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 00:07:24,353 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum20.i[1465,1478] [2023-12-16 00:07:24,357 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 00:07:24,371 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 00:07:24,399 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum20.i[1465,1478] [2023-12-16 00:07:24,400 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 00:07:24,412 INFO L206 MainTranslator]: Completed translation [2023-12-16 00:07:24,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:07:24 WrapperNode [2023-12-16 00:07:24,413 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 00:07:24,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 00:07:24,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 00:07:24,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 00:07:24,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:07:24" (1/1) ... [2023-12-16 00:07:24,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:07:24" (1/1) ... [2023-12-16 00:07:24,448 INFO L138 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2023-12-16 00:07:24,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 00:07:24,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 00:07:24,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 00:07:24,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 00:07:24,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:07:24" (1/1) ... [2023-12-16 00:07:24,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:07:24" (1/1) ... [2023-12-16 00:07:24,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:07:24" (1/1) ... [2023-12-16 00:07:24,472 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2023-12-16 00:07:24,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:07:24" (1/1) ... [2023-12-16 00:07:24,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:07:24" (1/1) ... [2023-12-16 00:07:24,478 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:07:24" (1/1) ... [2023-12-16 00:07:24,483 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:07:24" (1/1) ... [2023-12-16 00:07:24,484 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:07:24" (1/1) ... [2023-12-16 00:07:24,485 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:07:24" (1/1) ... [2023-12-16 00:07:24,487 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 00:07:24,488 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 00:07:24,488 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 00:07:24,488 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 00:07:24,489 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:07:24" (1/1) ... [2023-12-16 00:07:24,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 00:07:24,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:07:24,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 00:07:24,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 00:07:24,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 00:07:24,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 00:07:24,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 00:07:24,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 00:07:24,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 00:07:24,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 00:07:24,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 00:07:24,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 00:07:24,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 00:07:24,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 00:07:24,543 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2023-12-16 00:07:24,543 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2023-12-16 00:07:24,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 00:07:24,623 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 00:07:24,625 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 00:07:24,786 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 00:07:24,819 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 00:07:24,819 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-16 00:07:24,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:07:24 BoogieIcfgContainer [2023-12-16 00:07:24,820 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 00:07:24,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 00:07:24,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 00:07:24,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 00:07:24,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 12:07:24" (1/3) ... [2023-12-16 00:07:24,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f72bdda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:07:24, skipping insertion in model container [2023-12-16 00:07:24,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:07:24" (2/3) ... [2023-12-16 00:07:24,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f72bdda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:07:24, skipping insertion in model container [2023-12-16 00:07:24,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:07:24" (3/3) ... [2023-12-16 00:07:24,828 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum20.i [2023-12-16 00:07:24,841 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 00:07:24,841 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 00:07:24,878 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 00:07:24,883 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@41cbb5d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 00:07:24,884 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 00:07:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 00:07:24,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 00:07:24,894 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:07:24,894 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:07:24,895 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:07:24,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:07:24,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1502132506, now seen corresponding path program 1 times [2023-12-16 00:07:24,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:07:24,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545618834] [2023-12-16 00:07:24,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:07:24,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:07:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:07:25,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:07:25,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545618834] [2023-12-16 00:07:25,040 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-16 00:07:25,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811376275] [2023-12-16 00:07:25,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:07:25,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:07:25,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:07:25,045 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) [2023-12-16 00:07:25,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 00:07:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:07:25,180 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 00:07:25,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:07:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-16 00:07:25,205 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 00:07:25,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811376275] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:07:25,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:07:25,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 00:07:25,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085008145] [2023-12-16 00:07:25,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:07:25,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 00:07:25,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:07:25,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 00:07:25,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 00:07:25,249 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 00:07:25,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:07:25,286 INFO L93 Difference]: Finished difference Result 44 states and 65 transitions. [2023-12-16 00:07:25,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 00:07:25,289 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2023-12-16 00:07:25,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:07:25,294 INFO L225 Difference]: With dead ends: 44 [2023-12-16 00:07:25,295 INFO L226 Difference]: Without dead ends: 21 [2023-12-16 00:07:25,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 00:07:25,304 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:07:25,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:07:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-16 00:07:25,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-16 00:07:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 00:07:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2023-12-16 00:07:25,340 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 28 [2023-12-16 00:07:25,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:07:25,341 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2023-12-16 00:07:25,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 00:07:25,342 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2023-12-16 00:07:25,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 00:07:25,344 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:07:25,345 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:07:25,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 00:07:25,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-16 00:07:25,555 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:07:25,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:07:25,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1260265879, now seen corresponding path program 1 times [2023-12-16 00:07:25,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:07:25,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956137788] [2023-12-16 00:07:25,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:07:25,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:07:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:07:25,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:07:25,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956137788] [2023-12-16 00:07:25,591 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-16 00:07:25,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913442329] [2023-12-16 00:07:25,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:07:25,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:07:25,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:07:25,593 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) [2023-12-16 00:07:25,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 00:07:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:07:25,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 00:07:25,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:07:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 00:07:25,718 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 00:07:25,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913442329] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:07:25,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:07:25,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 00:07:25,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316838110] [2023-12-16 00:07:25,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:07:25,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 00:07:25,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:07:25,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 00:07:25,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 00:07:25,721 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 00:07:25,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:07:25,744 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2023-12-16 00:07:25,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 00:07:25,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2023-12-16 00:07:25,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:07:25,745 INFO L225 Difference]: With dead ends: 41 [2023-12-16 00:07:25,746 INFO L226 Difference]: Without dead ends: 22 [2023-12-16 00:07:25,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 00:07:25,777 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:07:25,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:07:25,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-16 00:07:25,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-16 00:07:25,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 00:07:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-12-16 00:07:25,791 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 28 [2023-12-16 00:07:25,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:07:25,792 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-12-16 00:07:25,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 00:07:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2023-12-16 00:07:25,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 00:07:25,793 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:07:25,793 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:07:25,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 00:07:25,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-16 00:07:25,994 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:07:25,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:07:25,995 INFO L85 PathProgramCache]: Analyzing trace with hash -432814053, now seen corresponding path program 1 times [2023-12-16 00:07:25,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:07:26,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533533276] [2023-12-16 00:07:26,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:07:26,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:07:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:07:26,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:07:26,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533533276] [2023-12-16 00:07:26,071 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-16 00:07:26,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8345808] [2023-12-16 00:07:26,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:07:26,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:07:26,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:07:26,076 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) [2023-12-16 00:07:26,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 00:07:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:07:26,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 00:07:26,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:07:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 00:07:26,170 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 00:07:26,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8345808] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:07:26,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:07:26,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 00:07:26,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494481331] [2023-12-16 00:07:26,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:07:26,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 00:07:26,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:07:26,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 00:07:26,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 00:07:26,172 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 00:07:26,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:07:26,199 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2023-12-16 00:07:26,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 00:07:26,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2023-12-16 00:07:26,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:07:26,200 INFO L225 Difference]: With dead ends: 42 [2023-12-16 00:07:26,201 INFO L226 Difference]: Without dead ends: 25 [2023-12-16 00:07:26,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 00:07:26,202 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:07:26,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 39 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:07:26,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-16 00:07:26,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2023-12-16 00:07:26,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 00:07:26,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-12-16 00:07:26,206 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 29 [2023-12-16 00:07:26,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:07:26,206 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-12-16 00:07:26,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 00:07:26,206 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2023-12-16 00:07:26,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 00:07:26,207 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:07:26,207 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:07:26,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-16 00:07:26,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:07:26,408 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:07:26,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:07:26,409 INFO L85 PathProgramCache]: Analyzing trace with hash 28977858, now seen corresponding path program 1 times [2023-12-16 00:07:26,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:07:26,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716494062] [2023-12-16 00:07:26,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:07:26,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:07:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:07:26,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:07:26,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716494062] [2023-12-16 00:07:26,440 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-16 00:07:26,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91658318] [2023-12-16 00:07:26,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:07:26,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:07:26,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:07:26,442 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) [2023-12-16 00:07:26,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-16 00:07:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:07:26,528 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 00:07:26,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:07:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-16 00:07:26,554 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 00:07:26,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91658318] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:07:26,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:07:26,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 00:07:26,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858317223] [2023-12-16 00:07:26,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:07:26,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 00:07:26,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:07:26,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 00:07:26,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 00:07:26,557 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 00:07:26,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:07:26,575 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2023-12-16 00:07:26,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 00:07:26,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2023-12-16 00:07:26,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:07:26,580 INFO L225 Difference]: With dead ends: 40 [2023-12-16 00:07:26,580 INFO L226 Difference]: Without dead ends: 25 [2023-12-16 00:07:26,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 00:07:26,583 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 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 [2023-12-16 00:07:26,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:07:26,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-16 00:07:26,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-16 00:07:26,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 00:07:26,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2023-12-16 00:07:26,599 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 38 [2023-12-16 00:07:26,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:07:26,600 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2023-12-16 00:07:26,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 00:07:26,600 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2023-12-16 00:07:26,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-16 00:07:26,601 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:07:26,601 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:07:26,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-16 00:07:26,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:07:26,802 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:07:26,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:07:26,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2098863663, now seen corresponding path program 1 times [2023-12-16 00:07:26,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:07:26,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059669879] [2023-12-16 00:07:26,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:07:26,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:07:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:07:26,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:07:26,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059669879] [2023-12-16 00:07:26,831 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-16 00:07:26,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142079519] [2023-12-16 00:07:26,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:07:26,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:07:26,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:07:26,833 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) [2023-12-16 00:07:26,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-16 00:07:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:07:26,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 00:07:26,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:07:26,928 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-16 00:07:26,928 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 00:07:26,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142079519] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:07:26,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:07:26,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 00:07:26,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788243139] [2023-12-16 00:07:26,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:07:26,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 00:07:26,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:07:26,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 00:07:26,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 00:07:26,935 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 00:07:26,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:07:26,959 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2023-12-16 00:07:26,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 00:07:26,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2023-12-16 00:07:26,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:07:26,961 INFO L225 Difference]: With dead ends: 51 [2023-12-16 00:07:26,961 INFO L226 Difference]: Without dead ends: 31 [2023-12-16 00:07:26,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 00:07:26,962 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:07:26,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 42 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:07:26,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-16 00:07:26,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-12-16 00:07:26,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 00:07:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2023-12-16 00:07:26,976 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 39 [2023-12-16 00:07:26,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:07:26,976 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-12-16 00:07:26,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 00:07:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2023-12-16 00:07:26,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-16 00:07:26,979 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:07:26,979 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:07:26,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-16 00:07:27,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:07:27,185 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:07:27,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:07:27,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1976122640, now seen corresponding path program 1 times [2023-12-16 00:07:27,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:07:27,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619516666] [2023-12-16 00:07:27,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:07:27,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:07:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:07:27,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-16 00:07:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:07:27,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 00:07:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:07:27,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-16 00:07:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:07:27,323 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-16 00:07:27,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:07:27,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619516666] [2023-12-16 00:07:27,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619516666] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:07:27,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733895848] [2023-12-16 00:07:27,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:07:27,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:07:27,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:07:27,329 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) [2023-12-16 00:07:27,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-16 00:07:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:07:27,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 00:07:27,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:07:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-16 00:07:27,441 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:07:27,478 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-16 00:07:27,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733895848] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:07:27,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 00:07:27,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2023-12-16 00:07:27,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312439143] [2023-12-16 00:07:27,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 00:07:27,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 00:07:27,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:07:27,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 00:07:27,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-16 00:07:27,483 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 00:07:27,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:07:27,507 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2023-12-16 00:07:27,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 00:07:27,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2023-12-16 00:07:27,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:07:27,509 INFO L225 Difference]: With dead ends: 58 [2023-12-16 00:07:27,509 INFO L226 Difference]: Without dead ends: 32 [2023-12-16 00:07:27,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-16 00:07:27,510 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:07:27,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:07:27,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-16 00:07:27,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-16 00:07:27,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 00:07:27,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2023-12-16 00:07:27,518 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 39 [2023-12-16 00:07:27,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:07:27,519 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2023-12-16 00:07:27,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 00:07:27,519 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2023-12-16 00:07:27,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-16 00:07:27,523 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:07:27,524 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:07:27,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-16 00:07:27,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:07:27,724 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:07:27,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:07:27,725 INFO L85 PathProgramCache]: Analyzing trace with hash -71399842, now seen corresponding path program 2 times [2023-12-16 00:07:27,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:07:27,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234086057] [2023-12-16 00:07:27,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:07:27,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:07:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:07:27,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 00:07:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:07:27,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 00:07:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:07:27,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 00:07:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:07:27,885 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-16 00:07:27,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:07:27,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234086057] [2023-12-16 00:07:27,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234086057] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:07:27,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579432415] [2023-12-16 00:07:27,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 00:07:27,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:07:27,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:07:27,894 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 00:07:27,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-16 00:07:27,980 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 00:07:27,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 00:07:27,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 00:07:27,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:07:28,035 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-16 00:07:28,036 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:07:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-16 00:07:28,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579432415] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:07:28,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 00:07:28,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 7] total 14 [2023-12-16 00:07:28,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430480502] [2023-12-16 00:07:28,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 00:07:28,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 00:07:28,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:07:28,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 00:07:28,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-12-16 00:07:28,106 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 00:07:28,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:07:28,149 INFO L93 Difference]: Finished difference Result 68 states and 94 transitions. [2023-12-16 00:07:28,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 00:07:28,150 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 42 [2023-12-16 00:07:28,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:07:28,150 INFO L225 Difference]: With dead ends: 68 [2023-12-16 00:07:28,150 INFO L226 Difference]: Without dead ends: 42 [2023-12-16 00:07:28,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-12-16 00:07:28,152 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:07:28,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 76 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:07:28,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-16 00:07:28,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2023-12-16 00:07:28,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 00:07:28,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2023-12-16 00:07:28,157 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 42 [2023-12-16 00:07:28,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:07:28,157 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2023-12-16 00:07:28,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 00:07:28,157 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2023-12-16 00:07:28,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-16 00:07:28,158 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:07:28,158 INFO L195 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:07:28,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-16 00:07:28,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:07:28,367 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:07:28,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:07:28,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1756456273, now seen corresponding path program 3 times [2023-12-16 00:07:28,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:07:28,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855916863] [2023-12-16 00:07:28,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:07:28,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:07:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:07:28,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 00:07:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:07:28,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 00:07:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:07:28,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 00:07:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:07:28,483 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2023-12-16 00:07:28,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:07:28,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855916863] [2023-12-16 00:07:28,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855916863] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:07:28,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518293895] [2023-12-16 00:07:28,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 00:07:28,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:07:28,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:07:28,485 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 00:07:28,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-16 00:07:28,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-16 00:07:28,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 00:07:28,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 00:07:28,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:07:28,577 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2023-12-16 00:07:28,577 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 00:07:28,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518293895] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:07:28,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 00:07:28,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-12-16 00:07:28,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693128042] [2023-12-16 00:07:28,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:07:28,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 00:07:28,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:07:28,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 00:07:28,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 00:07:28,579 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 00:07:28,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:07:28,598 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2023-12-16 00:07:28,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 00:07:28,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 57 [2023-12-16 00:07:28,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:07:28,600 INFO L225 Difference]: With dead ends: 71 [2023-12-16 00:07:28,600 INFO L226 Difference]: Without dead ends: 44 [2023-12-16 00:07:28,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 00:07:28,601 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:07:28,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 38 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:07:28,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-16 00:07:28,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2023-12-16 00:07:28,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 00:07:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2023-12-16 00:07:28,606 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 57 [2023-12-16 00:07:28,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:07:28,606 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2023-12-16 00:07:28,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 00:07:28,606 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2023-12-16 00:07:28,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-16 00:07:28,607 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:07:28,607 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:07:28,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-16 00:07:28,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-16 00:07:28,813 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:07:28,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:07:28,814 INFO L85 PathProgramCache]: Analyzing trace with hash 882234655, now seen corresponding path program 1 times [2023-12-16 00:07:28,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:07:28,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200810600] [2023-12-16 00:07:28,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:07:28,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:07:28,835 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 00:07:28,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1743709059] [2023-12-16 00:07:28,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:07:28,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:07:28,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:07:28,837 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 00:07:28,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-16 00:07:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:07:28,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 00:07:28,945 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:07:29,028 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2023-12-16 00:07:29,028 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:07:29,193 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2023-12-16 00:07:29,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:07:29,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200810600] [2023-12-16 00:07:29,194 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 00:07:29,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743709059] [2023-12-16 00:07:29,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743709059] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:07:29,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 00:07:29,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2023-12-16 00:07:29,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631456296] [2023-12-16 00:07:29,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 00:07:29,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-16 00:07:29,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:07:29,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-16 00:07:29,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2023-12-16 00:07:29,196 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 00:07:29,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:07:29,229 INFO L93 Difference]: Finished difference Result 76 states and 97 transitions. [2023-12-16 00:07:29,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-16 00:07:29,231 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 66 [2023-12-16 00:07:29,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:07:29,231 INFO L225 Difference]: With dead ends: 76 [2023-12-16 00:07:29,232 INFO L226 Difference]: Without dead ends: 49 [2023-12-16 00:07:29,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2023-12-16 00:07:29,235 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:07:29,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:07:29,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-16 00:07:29,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-16 00:07:29,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 00:07:29,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2023-12-16 00:07:29,241 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 66 [2023-12-16 00:07:29,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:07:29,241 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2023-12-16 00:07:29,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 00:07:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2023-12-16 00:07:29,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-16 00:07:29,242 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:07:29,242 INFO L195 NwaCegarLoop]: trace histogram [20, 9, 9, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:07:29,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-16 00:07:29,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:07:29,448 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:07:29,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:07:29,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1047210913, now seen corresponding path program 2 times [2023-12-16 00:07:29,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:07:29,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895229763] [2023-12-16 00:07:29,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:07:29,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:07:29,484 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 00:07:29,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [72339814] [2023-12-16 00:07:29,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 00:07:29,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:07:29,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:07:29,486 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 00:07:29,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-16 00:07:29,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 00:07:29,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 00:07:29,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 00:07:29,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:07:29,646 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 61 proven. 7 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2023-12-16 00:07:29,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:07:29,684 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 5 proven. 81 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2023-12-16 00:07:29,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:07:29,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895229763] [2023-12-16 00:07:29,684 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 00:07:29,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72339814] [2023-12-16 00:07:29,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72339814] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:07:29,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 00:07:29,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-16 00:07:29,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342183158] [2023-12-16 00:07:29,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 00:07:29,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 00:07:29,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:07:29,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 00:07:29,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-12-16 00:07:29,687 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 00:07:29,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:07:29,721 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2023-12-16 00:07:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 00:07:29,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 76 [2023-12-16 00:07:29,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:07:29,722 INFO L225 Difference]: With dead ends: 86 [2023-12-16 00:07:29,722 INFO L226 Difference]: Without dead ends: 61 [2023-12-16 00:07:29,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-12-16 00:07:29,723 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:07:29,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:07:29,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-16 00:07:29,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-12-16 00:07:29,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 56 states have internal predecessors, (61), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 00:07:29,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2023-12-16 00:07:29,730 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 76 [2023-12-16 00:07:29,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:07:29,732 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2023-12-16 00:07:29,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 00:07:29,732 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2023-12-16 00:07:29,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-16 00:07:29,733 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:07:29,733 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 18, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:07:29,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-16 00:07:29,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-16 00:07:29,939 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:07:29,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:07:29,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1459259423, now seen corresponding path program 3 times [2023-12-16 00:07:29,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:07:29,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213776493] [2023-12-16 00:07:29,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:07:29,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:07:29,968 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 00:07:29,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [265341817] [2023-12-16 00:07:29,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 00:07:29,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:07:29,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:07:29,969 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 00:07:29,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-16 00:07:30,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-16 00:07:30,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 00:07:30,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 00:07:30,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:07:30,089 INFO L134 CoverageAnalysis]: Checked inductivity of 919 backedges. 332 proven. 1 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2023-12-16 00:07:30,089 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:07:30,108 INFO L134 CoverageAnalysis]: Checked inductivity of 919 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 918 trivial. 0 not checked. [2023-12-16 00:07:30,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:07:30,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213776493] [2023-12-16 00:07:30,108 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 00:07:30,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265341817] [2023-12-16 00:07:30,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265341817] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:07:30,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 00:07:30,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 00:07:30,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419765471] [2023-12-16 00:07:30,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 00:07:30,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 00:07:30,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:07:30,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 00:07:30,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-16 00:07:30,110 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 00:07:30,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:07:30,122 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2023-12-16 00:07:30,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 00:07:30,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 112 [2023-12-16 00:07:30,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:07:30,123 INFO L225 Difference]: With dead ends: 96 [2023-12-16 00:07:30,123 INFO L226 Difference]: Without dead ends: 64 [2023-12-16 00:07:30,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-16 00:07:30,124 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:07:30,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:07:30,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-16 00:07:30,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-12-16 00:07:30,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 00:07:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2023-12-16 00:07:30,154 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 112 [2023-12-16 00:07:30,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:07:30,155 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2023-12-16 00:07:30,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 00:07:30,155 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2023-12-16 00:07:30,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-16 00:07:30,156 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:07:30,156 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 18, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:07:30,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-16 00:07:30,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-16 00:07:30,362 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:07:30,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:07:30,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1133256754, now seen corresponding path program 4 times [2023-12-16 00:07:30,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:07:30,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543784591] [2023-12-16 00:07:30,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:07:30,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:07:30,389 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 00:07:30,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [459584622] [2023-12-16 00:07:30,389 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 00:07:30,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:07:30,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:07:30,390 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 00:07:30,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-16 00:07:30,509 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 00:07:30,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 00:07:30,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 00:07:30,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:07:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 928 backedges. 309 proven. 57 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2023-12-16 00:07:30,566 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:07:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 928 backedges. 13 proven. 387 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2023-12-16 00:07:30,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:07:30,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543784591] [2023-12-16 00:07:30,654 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 00:07:30,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459584622] [2023-12-16 00:07:30,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459584622] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:07:30,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 00:07:30,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2023-12-16 00:07:30,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163730351] [2023-12-16 00:07:30,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 00:07:30,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 00:07:30,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:07:30,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 00:07:30,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-12-16 00:07:30,656 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 00:07:30,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:07:30,700 INFO L93 Difference]: Finished difference Result 119 states and 137 transitions. [2023-12-16 00:07:30,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 00:07:30,701 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 115 [2023-12-16 00:07:30,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:07:30,703 INFO L225 Difference]: With dead ends: 119 [2023-12-16 00:07:30,703 INFO L226 Difference]: Without dead ends: 79 [2023-12-16 00:07:30,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 214 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-12-16 00:07:30,704 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:07:30,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 57 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:07:30,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-16 00:07:30,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-12-16 00:07:30,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.0675675675675675) internal successors, (79), 74 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 00:07:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2023-12-16 00:07:30,712 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 115 [2023-12-16 00:07:30,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:07:30,713 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2023-12-16 00:07:30,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 00:07:30,713 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2023-12-16 00:07:30,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-12-16 00:07:30,714 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:07:30,714 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 33, 20, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:07:30,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-16 00:07:30,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-16 00:07:30,921 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:07:30,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:07:30,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1962881113, now seen corresponding path program 5 times [2023-12-16 00:07:30,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:07:30,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344098631] [2023-12-16 00:07:30,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:07:30,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:07:30,951 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 00:07:30,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [758399623] [2023-12-16 00:07:30,951 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 00:07:30,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:07:30,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:07:30,953 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 00:07:30,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-16 00:07:31,065 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-12-16 00:07:31,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 00:07:31,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 00:07:31,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:07:31,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 1023 proven. 26 refuted. 0 times theorem prover too weak. 1184 trivial. 0 not checked. [2023-12-16 00:07:31,110 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:07:31,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 107 proven. 378 refuted. 0 times theorem prover too weak. 1748 trivial. 0 not checked. [2023-12-16 00:07:31,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:07:31,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344098631] [2023-12-16 00:07:31,178 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 00:07:31,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758399623] [2023-12-16 00:07:31,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758399623] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:07:31,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 00:07:31,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-12-16 00:07:31,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207961132] [2023-12-16 00:07:31,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 00:07:31,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 00:07:31,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:07:31,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 00:07:31,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-12-16 00:07:31,180 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 00:07:31,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:07:31,224 INFO L93 Difference]: Finished difference Result 158 states and 187 transitions. [2023-12-16 00:07:31,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 00:07:31,224 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 160 [2023-12-16 00:07:31,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:07:31,226 INFO L225 Difference]: With dead ends: 158 [2023-12-16 00:07:31,226 INFO L226 Difference]: Without dead ends: 103 [2023-12-16 00:07:31,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 306 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-12-16 00:07:31,227 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:07:31,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 74 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:07:31,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-16 00:07:31,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-12-16 00:07:31,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.1326530612244898) internal successors, (111), 98 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 00:07:31,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2023-12-16 00:07:31,234 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 160 [2023-12-16 00:07:31,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:07:31,234 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2023-12-16 00:07:31,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 00:07:31,234 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2023-12-16 00:07:31,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2023-12-16 00:07:31,236 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:07:31,236 INFO L195 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:07:31,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-16 00:07:31,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-16 00:07:31,448 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:07:31,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:07:31,449 INFO L85 PathProgramCache]: Analyzing trace with hash -618674649, now seen corresponding path program 6 times [2023-12-16 00:07:31,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:07:31,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433764073] [2023-12-16 00:07:31,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:07:31,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:07:31,484 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 00:07:31,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [904550244] [2023-12-16 00:07:31,485 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-16 00:07:31,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:07:31,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:07:31,486 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 00:07:31,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-16 00:07:31,687 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-12-16 00:07:31,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 00:07:31,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 00:07:31,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:07:31,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5725 backedges. 2490 proven. 10 refuted. 0 times theorem prover too weak. 3225 trivial. 0 not checked. [2023-12-16 00:07:31,728 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:07:31,815 INFO L134 CoverageAnalysis]: Checked inductivity of 5725 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5715 trivial. 0 not checked. [2023-12-16 00:07:31,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:07:31,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433764073] [2023-12-16 00:07:31,815 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 00:07:31,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904550244] [2023-12-16 00:07:31,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904550244] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:07:31,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 00:07:31,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-16 00:07:31,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101746777] [2023-12-16 00:07:31,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 00:07:31,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 00:07:31,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:07:31,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 00:07:31,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-12-16 00:07:31,818 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 00:07:31,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:07:31,841 INFO L93 Difference]: Finished difference Result 180 states and 210 transitions. [2023-12-16 00:07:31,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 00:07:31,841 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 232 [2023-12-16 00:07:31,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:07:31,842 INFO L225 Difference]: With dead ends: 180 [2023-12-16 00:07:31,842 INFO L226 Difference]: Without dead ends: 109 [2023-12-16 00:07:31,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-12-16 00:07:31,843 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:07:31,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:07:31,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-16 00:07:31,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-12-16 00:07:31,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.125) internal successors, (117), 104 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 00:07:31,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2023-12-16 00:07:31,849 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 232 [2023-12-16 00:07:31,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:07:31,850 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2023-12-16 00:07:31,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 00:07:31,850 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2023-12-16 00:07:31,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2023-12-16 00:07:31,852 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:07:31,852 INFO L195 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:07:31,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-16 00:07:32,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:07:32,059 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:07:32,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:07:32,060 INFO L85 PathProgramCache]: Analyzing trace with hash 314336455, now seen corresponding path program 7 times [2023-12-16 00:07:32,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:07:32,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804375706] [2023-12-16 00:07:32,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:07:32,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:07:32,094 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 00:07:32,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [979328432] [2023-12-16 00:07:32,094 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-16 00:07:32,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:07:32,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:07:32,095 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 00:07:32,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-16 00:07:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:07:32,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 00:07:32,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:07:32,404 INFO L134 CoverageAnalysis]: Checked inductivity of 5770 backedges. 2490 proven. 55 refuted. 0 times theorem prover too weak. 3225 trivial. 0 not checked. [2023-12-16 00:07:32,404 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:07:32,591 INFO L134 CoverageAnalysis]: Checked inductivity of 5770 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5715 trivial. 0 not checked. [2023-12-16 00:07:32,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:07:32,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804375706] [2023-12-16 00:07:32,591 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 00:07:32,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979328432] [2023-12-16 00:07:32,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979328432] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:07:32,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 00:07:32,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2023-12-16 00:07:32,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6687214] [2023-12-16 00:07:32,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 00:07:32,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-16 00:07:32,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:07:32,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-16 00:07:32,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2023-12-16 00:07:32,593 INFO L87 Difference]: Start difference. First operand 109 states and 123 transitions. Second operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 00:07:32,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:07:32,629 INFO L93 Difference]: Finished difference Result 189 states and 222 transitions. [2023-12-16 00:07:32,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-16 00:07:32,630 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 238 [2023-12-16 00:07:32,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:07:32,631 INFO L225 Difference]: With dead ends: 189 [2023-12-16 00:07:32,631 INFO L226 Difference]: Without dead ends: 118 [2023-12-16 00:07:32,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 452 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2023-12-16 00:07:32,633 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:07:32,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:07:32,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-16 00:07:32,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-12-16 00:07:32,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.1150442477876106) internal successors, (126), 113 states have internal predecessors, (126), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 00:07:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2023-12-16 00:07:32,639 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 238 [2023-12-16 00:07:32,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:07:32,639 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2023-12-16 00:07:32,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 00:07:32,640 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2023-12-16 00:07:32,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2023-12-16 00:07:32,642 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:07:32,642 INFO L195 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:07:32,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-12-16 00:07:32,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-16 00:07:32,844 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:07:32,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:07:32,845 INFO L85 PathProgramCache]: Analyzing trace with hash 487831406, now seen corresponding path program 8 times [2023-12-16 00:07:32,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:07:32,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751363377] [2023-12-16 00:07:32,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:07:32,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:07:32,914 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 00:07:32,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [357222275] [2023-12-16 00:07:32,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 00:07:32,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:07:32,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:07:32,928 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 00:07:32,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-16 00:07:36,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 00:07:36,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-16 00:07:36,170 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 00:07:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 00:07:38,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 00:07:38,470 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 00:07:38,471 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 00:07:38,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-12-16 00:07:38,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-16 00:07:38,675 INFO L445 BasicCegarLoop]: Path program histogram: [8, 3, 1, 1, 1, 1, 1] [2023-12-16 00:07:38,678 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 00:07:38,755 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-12-16 00:07:38,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 12:07:38 BoogieIcfgContainer [2023-12-16 00:07:38,802 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 00:07:38,802 INFO L158 Benchmark]: Toolchain (without parser) took 14633.06ms. Allocated memory was 191.9MB in the beginning and 240.1MB in the end (delta: 48.2MB). Free memory was 145.3MB in the beginning and 192.9MB in the end (delta: -47.6MB). Peak memory consumption was 120.1MB. Max. memory is 8.0GB. [2023-12-16 00:07:38,802 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 191.9MB. Free memory is still 148.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 00:07:38,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.97ms. Allocated memory is still 191.9MB. Free memory was 144.8MB in the beginning and 133.7MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-16 00:07:38,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.89ms. Allocated memory is still 191.9MB. Free memory was 133.7MB in the beginning and 132.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 00:07:38,803 INFO L158 Benchmark]: Boogie Preprocessor took 37.64ms. Allocated memory is still 191.9MB. Free memory was 132.2MB in the beginning and 130.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 00:07:38,803 INFO L158 Benchmark]: RCFGBuilder took 332.36ms. Allocated memory is still 191.9MB. Free memory was 130.1MB in the beginning and 116.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 00:07:38,804 INFO L158 Benchmark]: TraceAbstraction took 13980.06ms. Allocated memory was 191.9MB in the beginning and 240.1MB in the end (delta: 48.2MB). Free memory was 116.0MB in the beginning and 192.9MB in the end (delta: -76.9MB). Peak memory consumption was 90.8MB. Max. memory is 8.0GB. [2023-12-16 00:07:38,807 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 191.9MB. Free memory is still 148.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.97ms. Allocated memory is still 191.9MB. Free memory was 144.8MB in the beginning and 133.7MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.89ms. Allocated memory is still 191.9MB. Free memory was 133.7MB in the beginning and 132.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.64ms. Allocated memory is still 191.9MB. Free memory was 132.2MB in the beginning and 130.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 332.36ms. Allocated memory is still 191.9MB. Free memory was 130.1MB in the beginning and 116.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 13980.06ms. Allocated memory was 191.9MB in the beginning and 240.1MB in the end (delta: 48.2MB). Free memory was 116.0MB in the beginning and 192.9MB in the end (delta: -76.9MB). Peak memory consumption was 90.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 61]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int x[20]; [L43] CALL init_nondet(x) [L16] int i; [L17] i = 0 VAL [i=0, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=6, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=7, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=8, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=9, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=10, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=11, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=12, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=13, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=14, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=15, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=16, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=17, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=18, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=19, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=20, x={3:0}, x={3:0}] [L17] COND FALSE !(i < 20) VAL [i=20, x={3:0}, x={3:0}] [L43] RET init_nondet(x) [L44] int temp; [L45] int ret; [L46] int ret2; [L47] int ret5; VAL [x={3:0}] [L49] CALL, EXPR rangesum(x) VAL [x={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=11, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=11, ret=0, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=11, ret=-7, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=1, i=12, ret=-7, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=1, i=12, ret=-7, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=12, ret=-7, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=2, i=13, ret=-7, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=2, i=13, ret=-7, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=3, i=13, ret=-7, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=3, i=14, ret=-7, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=3, i=14, ret=-7, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=4, i=14, ret=-4, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=4, i=15, ret=-4, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=4, i=15, ret=-4, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=5, i=15, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=5, i=16, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=5, i=16, ret=0, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=6, i=16, ret=2147483647, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=6, i=17, ret=2147483647, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=6, i=17, ret=2147483647, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=7, i=17, ret=2, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=7, i=18, ret=2, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=7, i=18, ret=2, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=8, i=18, ret=-2147483646, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=8, i=19, ret=-2147483646, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=8, i=19, ret=-2147483646, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=9, i=19, ret=-2147483655, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=9, i=20, ret=-2147483655, x={3:0}, x={3:0}] [L28] COND FALSE !(i < 20) VAL [cnt=9, i=20, ret=-2147483655, x={3:0}, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=-238609295, cnt=9, i=20, ret=-2147483655, x={3:0}, x={3:0}] [L49] RET, EXPR rangesum(x) VAL [x={3:0}] [L49] ret = rangesum(x) [L51] EXPR x[0] [L51] temp=x[0] [L51] EXPR x[1] [L51] x[0] = x[1] [L51] x[1] = temp [L52] CALL, EXPR rangesum(x) VAL [x={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=11, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=11, ret=0, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=11, ret=-7, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=1, i=12, ret=-7, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=1, i=12, ret=-7, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=12, ret=-7, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=2, i=13, ret=-7, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=2, i=13, ret=-7, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=3, i=13, ret=-7, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=3, i=14, ret=-7, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=3, i=14, ret=-7, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=4, i=14, ret=-4, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=4, i=15, ret=-4, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=4, i=15, ret=-4, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=5, i=15, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=5, i=16, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=5, i=16, ret=0, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=6, i=16, ret=2147483647, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=6, i=17, ret=2147483647, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=6, i=17, ret=2147483647, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=7, i=17, ret=2, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=7, i=18, ret=2, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=7, i=18, ret=2, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=8, i=18, ret=-2147483646, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=8, i=19, ret=-2147483646, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=8, i=19, ret=-2147483646, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=9, i=19, ret=-2147483655, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=9, i=20, ret=-2147483655, x={3:0}, x={3:0}] [L28] COND FALSE !(i < 20) VAL [cnt=9, i=20, ret=-2147483655, x={3:0}, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=-238609295, cnt=9, i=20, ret=-2147483655, x={3:0}, x={3:0}] [L52] RET, EXPR rangesum(x) VAL [ret=-238609295, temp=2147483646, x={3:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret2=-238609295, ret=-238609295, temp=2147483640, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret2=-238609295, ret=-238609295, temp=2147483640, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret2=-238609295, ret=-238609295, temp=2147483640, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret2=-238609295, ret=-238609295, temp=2147483640, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret2=-238609295, ret=-238609295, temp=2147483640, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=5, ret2=-238609295, ret=-238609295, temp=2147483640, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=6, ret2=-238609295, ret=-238609295, temp=2147483640, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=7, ret2=-238609295, ret=-238609295, temp=2147483640, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=8, ret2=-238609295, ret=-238609295, temp=2147483640, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=9, ret2=-238609295, ret=-238609295, temp=2147483640, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=10, ret2=-238609295, ret=-238609295, temp=2147483640, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=11, ret2=-238609295, ret=-238609295, temp=2147483640, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=12, ret2=-238609295, ret=-238609295, temp=2147483640, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=13, ret2=-238609295, ret=-238609295, temp=2147483640, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=14, ret2=-238609295, ret=-238609295, temp=2147483640, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=15, ret2=-238609295, ret=-238609295, temp=2147483640, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=16, ret2=-238609295, ret=-238609295, temp=2147483640, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=17, ret2=-238609295, ret=-238609295, temp=2147483640, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=18, ret2=-238609295, ret=-238609295, temp=2147483640, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=19, ret2=-238609295, ret=-238609295, temp=2147483640, x={3:0}] [L54] COND FALSE !(i<20 -1) VAL [i=19, ret2=-238609295, ret=-238609295, temp=2147483640, x={3:0}] [L57] x[20 -1] = temp [L58] CALL, EXPR rangesum(x) VAL [x={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=11, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=11, ret=0, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=11, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=1, i=12, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=1, i=12, ret=0, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=12, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=2, i=13, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=2, i=13, ret=0, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=3, i=13, ret=3, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=3, i=14, ret=3, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=3, i=14, ret=3, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=4, i=14, ret=7, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=4, i=15, ret=7, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=4, i=15, ret=7, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=5, i=15, ret=2147483654, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=5, i=16, ret=2147483654, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=5, i=16, ret=2147483654, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=6, i=16, ret=9, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=6, i=17, ret=9, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=6, i=17, ret=9, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=7, i=17, ret=-2147483639, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=7, i=18, ret=-2147483639, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=7, i=18, ret=-2147483639, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=8, i=18, ret=-2147483648, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=8, i=19, ret=-2147483648, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=8, i=19, ret=-2147483648, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=9, i=19, ret=-8, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=9, i=20, ret=-8, x={3:0}, x={3:0}] [L28] COND FALSE !(i < 20) VAL [cnt=9, i=20, ret=-8, x={3:0}, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=0, cnt=9, i=20, ret=-8, x={3:0}, x={3:0}] [L58] RET, EXPR rangesum(x) VAL [ret2=-238609295, ret=-238609295, temp=2147483640, x={3:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [ret2=-238609295, ret5=0, ret=-238609295, temp=2147483640, x={3:0}] [L61] reach_error() VAL [ret2=-238609295, ret5=0, ret=-238609295, temp=2147483640, x={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.8s, OverallIterations: 16, TraceHistogramMax: 60, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 957 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 618 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 358 IncrementalHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 339 mSDtfsCounter, 358 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2385 GetRequests, 2272 SyntacticMatches, 10 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=15, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1846 NumberOfCodeBlocks, 1368 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 2490 ConstructedInterpolants, 0 QuantifiedInterpolants, 2838 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3280 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 31668/32904 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-16 00:07:38,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...