/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-63.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 20:29:13,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 20:29:13,808 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-15 20:29:13,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 20:29:13,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 20:29:13,841 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 20:29:13,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 20:29:13,841 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 20:29:13,842 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 20:29:13,845 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 20:29:13,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 20:29:13,845 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 20:29:13,845 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 20:29:13,846 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 20:29:13,846 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 20:29:13,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 20:29:13,847 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 20:29:13,847 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 20:29:13,847 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 20:29:13,848 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 20:29:13,848 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 20:29:13,848 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 20:29:13,848 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 20:29:13,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 20:29:13,849 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 20:29:13,849 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 20:29:13,849 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 20:29:13,849 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 20:29:13,850 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 20:29:13,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 20:29:13,851 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 20:29:13,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 20:29:13,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:29:13,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 20:29:13,851 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 20:29:13,851 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 20:29:13,851 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 20:29:13,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 20:29:13,851 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 20:29:13,851 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 20:29:13,852 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 20:29:13,852 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 20:29:13,852 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 20:29:13,852 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 -> true [2023-12-15 20:29:14,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 20:29:14,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 20:29:14,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 20:29:14,063 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 20:29:14,064 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 20:29:14,064 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-63.i [2023-12-15 20:29:15,077 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 20:29:15,249 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 20:29:15,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-63.i [2023-12-15 20:29:15,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/863ec5ae7/d84c254720b14c6890a29c9dc2a03cc8/FLAG3c6bfba18 [2023-12-15 20:29:15,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/863ec5ae7/d84c254720b14c6890a29c9dc2a03cc8 [2023-12-15 20:29:15,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 20:29:15,276 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 20:29:15,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 20:29:15,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 20:29:15,281 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 20:29:15,282 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:29:15" (1/1) ... [2023-12-15 20:29:15,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ed33046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:29:15, skipping insertion in model container [2023-12-15 20:29:15,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:29:15" (1/1) ... [2023-12-15 20:29:15,315 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 20:29:15,431 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-63.i[919,932] [2023-12-15 20:29:15,517 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:29:15,527 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 20:29:15,540 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-63.i[919,932] [2023-12-15 20:29:15,571 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:29:15,585 INFO L206 MainTranslator]: Completed translation [2023-12-15 20:29:15,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:29:15 WrapperNode [2023-12-15 20:29:15,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 20:29:15,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 20:29:15,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 20:29:15,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 20:29:15,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:29:15" (1/1) ... [2023-12-15 20:29:15,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:29:15" (1/1) ... [2023-12-15 20:29:15,634 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 248 [2023-12-15 20:29:15,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 20:29:15,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 20:29:15,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 20:29:15,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 20:29:15,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:29:15" (1/1) ... [2023-12-15 20:29:15,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:29:15" (1/1) ... [2023-12-15 20:29:15,646 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:29:15" (1/1) ... [2023-12-15 20:29:15,659 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 20:29:15,659 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:29:15" (1/1) ... [2023-12-15 20:29:15,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:29:15" (1/1) ... [2023-12-15 20:29:15,666 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:29:15" (1/1) ... [2023-12-15 20:29:15,669 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:29:15" (1/1) ... [2023-12-15 20:29:15,671 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:29:15" (1/1) ... [2023-12-15 20:29:15,672 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:29:15" (1/1) ... [2023-12-15 20:29:15,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 20:29:15,676 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 20:29:15,676 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 20:29:15,676 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 20:29:15,677 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:29:15" (1/1) ... [2023-12-15 20:29:15,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:29:15,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:29:15,713 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-15 20:29:15,731 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-15 20:29:15,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 20:29:15,737 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 20:29:15,737 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 20:29:15,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 20:29:15,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 20:29:15,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 20:29:15,829 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 20:29:15,831 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 20:29:16,246 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 20:29:16,265 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 20:29:16,265 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 20:29:16,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:29:16 BoogieIcfgContainer [2023-12-15 20:29:16,266 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 20:29:16,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 20:29:16,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 20:29:16,269 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 20:29:16,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:29:15" (1/3) ... [2023-12-15 20:29:16,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca16208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:29:16, skipping insertion in model container [2023-12-15 20:29:16,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:29:15" (2/3) ... [2023-12-15 20:29:16,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca16208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:29:16, skipping insertion in model container [2023-12-15 20:29:16,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:29:16" (3/3) ... [2023-12-15 20:29:16,271 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-63.i [2023-12-15 20:29:16,283 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 20:29:16,283 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 20:29:16,321 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 20:29:16,325 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;@14bd5277, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 20:29:16,325 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 20:29:16,328 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 62 states have (on average 1.564516129032258) internal successors, (97), 63 states have internal predecessors, (97), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-15 20:29:16,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 20:29:16,338 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:29:16,338 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:29:16,339 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:29:16,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:29:16,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1565966231, now seen corresponding path program 1 times [2023-12-15 20:29:16,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:29:16,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652379680] [2023-12-15 20:29:16,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:29:16,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:29:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:16,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:29:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:16,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:29:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:16,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:29:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:16,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:29:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:16,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:29:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:16,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:29:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:16,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:29:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:16,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:29:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:16,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:29:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:16,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:29:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:16,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:29:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:16,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:29:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:16,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:29:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:16,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:29:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:16,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:29:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:16,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:29:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:16,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 20:29:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:16,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 20:29:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:16,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 20:29:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:16,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 20:29:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:16,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-15 20:29:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:16,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-15 20:29:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:29:16,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:29:16,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652379680] [2023-12-15 20:29:16,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652379680] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:29:16,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:29:16,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 20:29:16,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281129462] [2023-12-15 20:29:16,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:29:16,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 20:29:16,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:29:16,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 20:29:16,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:29:16,743 INFO L87 Difference]: Start difference. First operand has 87 states, 62 states have (on average 1.564516129032258) internal successors, (97), 63 states have internal predecessors, (97), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-15 20:29:16,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:29:16,803 INFO L93 Difference]: Finished difference Result 169 states and 298 transitions. [2023-12-15 20:29:16,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 20:29:16,805 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 155 [2023-12-15 20:29:16,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:29:16,809 INFO L225 Difference]: With dead ends: 169 [2023-12-15 20:29:16,810 INFO L226 Difference]: Without dead ends: 83 [2023-12-15 20:29:16,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-15 20:29:16,814 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:29:16,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:29:16,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-15 20:29:16,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-12-15 20:29:16,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 59 states have internal predecessors, (86), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-15 20:29:16,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 130 transitions. [2023-12-15 20:29:16,860 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 130 transitions. Word has length 155 [2023-12-15 20:29:16,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:29:16,860 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 130 transitions. [2023-12-15 20:29:16,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-15 20:29:16,861 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 130 transitions. [2023-12-15 20:29:16,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 20:29:16,868 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:29:16,869 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:29:16,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 20:29:16,870 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:29:16,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:29:16,871 INFO L85 PathProgramCache]: Analyzing trace with hash -896192373, now seen corresponding path program 1 times [2023-12-15 20:29:16,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:29:16,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961958293] [2023-12-15 20:29:16,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:29:16,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:29:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:29:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:29:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:29:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:29:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:29:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:29:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:29:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:29:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:29:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:29:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:29:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:29:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:29:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:29:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:29:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:29:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 20:29:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 20:29:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 20:29:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 20:29:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-15 20:29:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-15 20:29:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:29:17,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:29:17,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961958293] [2023-12-15 20:29:17,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961958293] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:29:17,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:29:17,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:29:17,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380660559] [2023-12-15 20:29:17,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:29:17,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:29:17,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:29:17,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:29:17,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:29:17,147 INFO L87 Difference]: Start difference. First operand 83 states and 130 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:17,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:29:17,208 INFO L93 Difference]: Finished difference Result 189 states and 296 transitions. [2023-12-15 20:29:17,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:29:17,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2023-12-15 20:29:17,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:29:17,210 INFO L225 Difference]: With dead ends: 189 [2023-12-15 20:29:17,210 INFO L226 Difference]: Without dead ends: 107 [2023-12-15 20:29:17,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-15 20:29:17,212 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 27 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:29:17,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 253 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:29:17,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-15 20:29:17,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 94. [2023-12-15 20:29:17,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 70 states have internal predecessors, (103), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-15 20:29:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 147 transitions. [2023-12-15 20:29:17,220 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 147 transitions. Word has length 155 [2023-12-15 20:29:17,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:29:17,221 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 147 transitions. [2023-12-15 20:29:17,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:17,221 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 147 transitions. [2023-12-15 20:29:17,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 20:29:17,222 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:29:17,222 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:29:17,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 20:29:17,223 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:29:17,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:29:17,223 INFO L85 PathProgramCache]: Analyzing trace with hash 789358667, now seen corresponding path program 1 times [2023-12-15 20:29:17,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:29:17,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504767067] [2023-12-15 20:29:17,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:29:17,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:29:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:29:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:29:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:29:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:29:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:29:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:29:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:29:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:29:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:29:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:29:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:29:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:29:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:29:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:29:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:29:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:29:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 20:29:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 20:29:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 20:29:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 20:29:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-15 20:29:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-15 20:29:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:17,669 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:29:17,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:29:17,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504767067] [2023-12-15 20:29:17,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504767067] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:29:17,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:29:17,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:29:17,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332382154] [2023-12-15 20:29:17,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:29:17,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:29:17,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:29:17,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:29:17,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:29:17,673 INFO L87 Difference]: Start difference. First operand 94 states and 147 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:17,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:29:17,854 INFO L93 Difference]: Finished difference Result 265 states and 419 transitions. [2023-12-15 20:29:17,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 20:29:17,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2023-12-15 20:29:17,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:29:17,856 INFO L225 Difference]: With dead ends: 265 [2023-12-15 20:29:17,856 INFO L226 Difference]: Without dead ends: 172 [2023-12-15 20:29:17,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:29:17,858 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 70 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:29:17,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 466 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:29:17,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-12-15 20:29:17,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 139. [2023-12-15 20:29:17,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 92 states have internal predecessors, (127), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-15 20:29:17,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 215 transitions. [2023-12-15 20:29:17,870 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 215 transitions. Word has length 155 [2023-12-15 20:29:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:29:17,871 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 215 transitions. [2023-12-15 20:29:17,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:17,871 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 215 transitions. [2023-12-15 20:29:17,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 20:29:17,872 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:29:17,872 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:29:17,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 20:29:17,872 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:29:17,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:29:17,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1582380595, now seen corresponding path program 1 times [2023-12-15 20:29:17,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:29:17,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96817789] [2023-12-15 20:29:17,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:29:17,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:29:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:18,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:29:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:18,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:29:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:18,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:29:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:18,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:29:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:18,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:29:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:18,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:29:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:18,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:29:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:18,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:29:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:18,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:29:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:18,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:29:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:18,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:29:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:18,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:29:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:18,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:29:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:18,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:29:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:18,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:29:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:18,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:29:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:18,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 20:29:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:18,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 20:29:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:18,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 20:29:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:18,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 20:29:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:18,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-15 20:29:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:18,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-15 20:29:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:18,242 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:29:18,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:29:18,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96817789] [2023-12-15 20:29:18,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96817789] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:29:18,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:29:18,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:29:18,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251686976] [2023-12-15 20:29:18,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:29:18,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:29:18,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:29:18,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:29:18,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:29:18,245 INFO L87 Difference]: Start difference. First operand 139 states and 215 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:18,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:29:18,431 INFO L93 Difference]: Finished difference Result 332 states and 519 transitions. [2023-12-15 20:29:18,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 20:29:18,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2023-12-15 20:29:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:29:18,436 INFO L225 Difference]: With dead ends: 332 [2023-12-15 20:29:18,436 INFO L226 Difference]: Without dead ends: 239 [2023-12-15 20:29:18,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:29:18,444 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 330 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:29:18,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 440 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:29:18,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-12-15 20:29:18,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 158. [2023-12-15 20:29:18,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 111 states have (on average 1.4144144144144144) internal successors, (157), 111 states have internal predecessors, (157), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-15 20:29:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 245 transitions. [2023-12-15 20:29:18,469 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 245 transitions. Word has length 155 [2023-12-15 20:29:18,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:29:18,469 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 245 transitions. [2023-12-15 20:29:18,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:18,469 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 245 transitions. [2023-12-15 20:29:18,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 20:29:18,470 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:29:18,470 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:29:18,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 20:29:18,470 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:29:18,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:29:18,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1701469451, now seen corresponding path program 1 times [2023-12-15 20:29:18,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:29:18,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805194931] [2023-12-15 20:29:18,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:29:18,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:29:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:29:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:29:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:29:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:29:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:29:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:29:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:29:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:29:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:29:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:29:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:29:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:29:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:29:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:29:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:29:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:29:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 20:29:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 20:29:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 20:29:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 20:29:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-15 20:29:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-15 20:29:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,152 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:29:19,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:29:19,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805194931] [2023-12-15 20:29:19,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805194931] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:29:19,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:29:19,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 20:29:19,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469927338] [2023-12-15 20:29:19,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:29:19,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 20:29:19,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:29:19,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 20:29:19,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:29:19,153 INFO L87 Difference]: Start difference. First operand 158 states and 245 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:19,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:29:19,605 INFO L93 Difference]: Finished difference Result 444 states and 687 transitions. [2023-12-15 20:29:19,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 20:29:19,606 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2023-12-15 20:29:19,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:29:19,608 INFO L225 Difference]: With dead ends: 444 [2023-12-15 20:29:19,608 INFO L226 Difference]: Without dead ends: 332 [2023-12-15 20:29:19,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-15 20:29:19,610 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 323 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 20:29:19,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 660 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 20:29:19,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-12-15 20:29:19,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 239. [2023-12-15 20:29:19,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 189 states have (on average 1.4761904761904763) internal successors, (279), 190 states have internal predecessors, (279), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-15 20:29:19,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 371 transitions. [2023-12-15 20:29:19,640 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 371 transitions. Word has length 155 [2023-12-15 20:29:19,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:29:19,640 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 371 transitions. [2023-12-15 20:29:19,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 371 transitions. [2023-12-15 20:29:19,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 20:29:19,641 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:29:19,642 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:29:19,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 20:29:19,642 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:29:19,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:29:19,642 INFO L85 PathProgramCache]: Analyzing trace with hash 12525709, now seen corresponding path program 1 times [2023-12-15 20:29:19,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:29:19,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874657409] [2023-12-15 20:29:19,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:29:19,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:29:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:29:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:29:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:29:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:29:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:29:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:29:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:29:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:29:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:29:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:29:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:29:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:29:19,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:29:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:29:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:29:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:29:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 20:29:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 20:29:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 20:29:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 20:29:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-15 20:29:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-15 20:29:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:29:19,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:29:19,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874657409] [2023-12-15 20:29:19,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874657409] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:29:19,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:29:19,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 20:29:19,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832506857] [2023-12-15 20:29:19,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:29:19,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 20:29:19,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:29:19,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 20:29:19,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:29:19,955 INFO L87 Difference]: Start difference. First operand 239 states and 371 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:20,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:29:20,264 INFO L93 Difference]: Finished difference Result 480 states and 736 transitions. [2023-12-15 20:29:20,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 20:29:20,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2023-12-15 20:29:20,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:29:20,267 INFO L225 Difference]: With dead ends: 480 [2023-12-15 20:29:20,267 INFO L226 Difference]: Without dead ends: 354 [2023-12-15 20:29:20,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-12-15 20:29:20,268 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 125 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:29:20,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 989 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:29:20,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2023-12-15 20:29:20,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 263. [2023-12-15 20:29:20,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 213 states have (on average 1.4694835680751173) internal successors, (313), 214 states have internal predecessors, (313), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-15 20:29:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 405 transitions. [2023-12-15 20:29:20,293 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 405 transitions. Word has length 155 [2023-12-15 20:29:20,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:29:20,293 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 405 transitions. [2023-12-15 20:29:20,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:20,293 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 405 transitions. [2023-12-15 20:29:20,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-15 20:29:20,294 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:29:20,294 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:29:20,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 20:29:20,295 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:29:20,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:29:20,295 INFO L85 PathProgramCache]: Analyzing trace with hash 409207, now seen corresponding path program 1 times [2023-12-15 20:29:20,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:29:20,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114315690] [2023-12-15 20:29:20,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:29:20,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:29:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:29:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:29:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:29:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:29:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:29:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:29:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:29:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:29:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:29:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:29:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:29:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:29:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:29:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:29:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:29:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:29:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 20:29:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 20:29:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 20:29:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 20:29:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-15 20:29:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-15 20:29:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:29:20,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:29:20,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114315690] [2023-12-15 20:29:20,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114315690] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:29:20,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:29:20,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:29:20,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209985914] [2023-12-15 20:29:20,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:29:20,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:29:20,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:29:20,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:29:20,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:29:20,379 INFO L87 Difference]: Start difference. First operand 263 states and 405 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:20,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:29:20,448 INFO L93 Difference]: Finished difference Result 499 states and 760 transitions. [2023-12-15 20:29:20,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:29:20,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2023-12-15 20:29:20,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:29:20,450 INFO L225 Difference]: With dead ends: 499 [2023-12-15 20:29:20,450 INFO L226 Difference]: Without dead ends: 361 [2023-12-15 20:29:20,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-15 20:29:20,451 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 108 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:29:20,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 249 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:29:20,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2023-12-15 20:29:20,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 255. [2023-12-15 20:29:20,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 205 states have (on average 1.448780487804878) internal successors, (297), 206 states have internal predecessors, (297), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-15 20:29:20,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 389 transitions. [2023-12-15 20:29:20,487 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 389 transitions. Word has length 156 [2023-12-15 20:29:20,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:29:20,487 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 389 transitions. [2023-12-15 20:29:20,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:20,488 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 389 transitions. [2023-12-15 20:29:20,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-15 20:29:20,489 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:29:20,489 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:29:20,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 20:29:20,489 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:29:20,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:29:20,489 INFO L85 PathProgramCache]: Analyzing trace with hash 2092766158, now seen corresponding path program 1 times [2023-12-15 20:29:20,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:29:20,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38107857] [2023-12-15 20:29:20,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:29:20,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:29:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:29:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:29:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:29:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:29:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:29:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:29:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:29:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:29:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:29:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:29:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:29:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:29:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:29:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:29:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:29:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:29:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 20:29:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 20:29:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 20:29:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 20:29:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-15 20:29:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-15 20:29:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:20,570 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:29:20,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:29:20,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38107857] [2023-12-15 20:29:20,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38107857] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:29:20,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:29:20,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:29:20,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600610251] [2023-12-15 20:29:20,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:29:20,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:29:20,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:29:20,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:29:20,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:29:20,571 INFO L87 Difference]: Start difference. First operand 255 states and 389 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:20,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:29:20,666 INFO L93 Difference]: Finished difference Result 469 states and 711 transitions. [2023-12-15 20:29:20,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:29:20,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2023-12-15 20:29:20,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:29:20,667 INFO L225 Difference]: With dead ends: 469 [2023-12-15 20:29:20,667 INFO L226 Difference]: Without dead ends: 333 [2023-12-15 20:29:20,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-15 20:29:20,668 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 106 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:29:20,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 325 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:29:20,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-12-15 20:29:20,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 253. [2023-12-15 20:29:20,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 203 states have (on average 1.4334975369458127) internal successors, (291), 204 states have internal predecessors, (291), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-15 20:29:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 383 transitions. [2023-12-15 20:29:20,704 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 383 transitions. Word has length 156 [2023-12-15 20:29:20,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:29:20,705 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 383 transitions. [2023-12-15 20:29:20,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:20,705 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 383 transitions. [2023-12-15 20:29:20,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-15 20:29:20,706 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:29:20,706 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:29:20,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 20:29:20,706 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:29:20,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:29:20,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1563934556, now seen corresponding path program 1 times [2023-12-15 20:29:20,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:29:20,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092767335] [2023-12-15 20:29:20,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:29:20,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:29:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:21,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:29:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:21,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:29:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:21,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:29:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:21,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:29:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:21,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:29:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:21,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:29:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:21,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:29:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:21,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:29:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:21,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:29:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:21,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:29:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:21,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:29:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:21,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:29:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:21,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:29:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:21,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:29:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:21,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:29:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:21,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:29:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:21,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 20:29:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:21,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 20:29:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:21,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 20:29:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:21,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 20:29:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:21,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-15 20:29:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:21,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-15 20:29:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:21,625 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:29:21,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:29:21,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092767335] [2023-12-15 20:29:21,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092767335] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:29:21,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:29:21,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-15 20:29:21,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152050545] [2023-12-15 20:29:21,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:29:21,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-15 20:29:21,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:29:21,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-15 20:29:21,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2023-12-15 20:29:21,627 INFO L87 Difference]: Start difference. First operand 253 states and 383 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:23,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:29:23,723 INFO L93 Difference]: Finished difference Result 771 states and 1154 transitions. [2023-12-15 20:29:23,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-15 20:29:23,724 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2023-12-15 20:29:23,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:29:23,726 INFO L225 Difference]: With dead ends: 771 [2023-12-15 20:29:23,726 INFO L226 Difference]: Without dead ends: 605 [2023-12-15 20:29:23,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=356, Invalid=2194, Unknown=0, NotChecked=0, Total=2550 [2023-12-15 20:29:23,727 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 478 mSDsluCounter, 2646 mSDsCounter, 0 mSdLazyCounter, 1718 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 3004 SdHoareTripleChecker+Invalid, 1850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:29:23,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 3004 Invalid, 1850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1718 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-15 20:29:23,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2023-12-15 20:29:23,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 249. [2023-12-15 20:29:23,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 199 states have (on average 1.3768844221105527) internal successors, (274), 200 states have internal predecessors, (274), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-15 20:29:23,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 366 transitions. [2023-12-15 20:29:23,761 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 366 transitions. Word has length 156 [2023-12-15 20:29:23,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:29:23,761 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 366 transitions. [2023-12-15 20:29:23,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:23,761 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 366 transitions. [2023-12-15 20:29:23,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-15 20:29:23,762 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:29:23,762 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:29:23,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 20:29:23,762 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:29:23,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:29:23,763 INFO L85 PathProgramCache]: Analyzing trace with hash -2036704474, now seen corresponding path program 1 times [2023-12-15 20:29:23,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:29:23,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174946457] [2023-12-15 20:29:23,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:29:23,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:29:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:23,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:29:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:23,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:29:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:23,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:29:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:23,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:29:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:23,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:29:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:23,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:29:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:23,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:29:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:23,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:29:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:23,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:29:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:29:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:29:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:29:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:29:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:29:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:29:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:29:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 20:29:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 20:29:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 20:29:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 20:29:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-15 20:29:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-15 20:29:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,032 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:29:24,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:29:24,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174946457] [2023-12-15 20:29:24,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174946457] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:29:24,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:29:24,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:29:24,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560646657] [2023-12-15 20:29:24,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:29:24,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:29:24,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:29:24,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:29:24,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:29:24,033 INFO L87 Difference]: Start difference. First operand 249 states and 366 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:24,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:29:24,191 INFO L93 Difference]: Finished difference Result 494 states and 722 transitions. [2023-12-15 20:29:24,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 20:29:24,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2023-12-15 20:29:24,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:29:24,193 INFO L225 Difference]: With dead ends: 494 [2023-12-15 20:29:24,193 INFO L226 Difference]: Without dead ends: 343 [2023-12-15 20:29:24,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:29:24,194 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 160 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:29:24,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 412 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:29:24,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2023-12-15 20:29:24,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 325. [2023-12-15 20:29:24,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 270 states have (on average 1.362962962962963) internal successors, (368), 272 states have internal predecessors, (368), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-15 20:29:24,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 468 transitions. [2023-12-15 20:29:24,228 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 468 transitions. Word has length 157 [2023-12-15 20:29:24,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:29:24,228 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 468 transitions. [2023-12-15 20:29:24,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:24,229 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 468 transitions. [2023-12-15 20:29:24,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-15 20:29:24,230 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:29:24,230 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:29:24,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 20:29:24,230 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:29:24,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:29:24,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1237194468, now seen corresponding path program 1 times [2023-12-15 20:29:24,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:29:24,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225949320] [2023-12-15 20:29:24,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:29:24,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:29:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:29:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:29:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:29:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:29:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:29:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:29:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:29:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:29:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:29:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:29:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:29:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:29:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:29:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:29:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:29:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:29:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 20:29:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 20:29:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 20:29:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 20:29:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-15 20:29:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-15 20:29:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,383 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:29:24,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:29:24,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225949320] [2023-12-15 20:29:24,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225949320] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:29:24,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:29:24,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 20:29:24,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63546907] [2023-12-15 20:29:24,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:29:24,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 20:29:24,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:29:24,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 20:29:24,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 20:29:24,385 INFO L87 Difference]: Start difference. First operand 325 states and 468 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:24,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:29:24,549 INFO L93 Difference]: Finished difference Result 597 states and 861 transitions. [2023-12-15 20:29:24,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 20:29:24,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2023-12-15 20:29:24,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:29:24,551 INFO L225 Difference]: With dead ends: 597 [2023-12-15 20:29:24,551 INFO L226 Difference]: Without dead ends: 425 [2023-12-15 20:29:24,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 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-15 20:29:24,552 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 244 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:29:24,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 430 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:29:24,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2023-12-15 20:29:24,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 342. [2023-12-15 20:29:24,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 287 states have (on average 1.3344947735191637) internal successors, (383), 289 states have internal predecessors, (383), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-15 20:29:24,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 483 transitions. [2023-12-15 20:29:24,590 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 483 transitions. Word has length 157 [2023-12-15 20:29:24,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:29:24,612 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 483 transitions. [2023-12-15 20:29:24,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:24,612 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 483 transitions. [2023-12-15 20:29:24,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-15 20:29:24,614 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:29:24,614 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:29:24,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 20:29:24,614 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:29:24,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:29:24,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1552618208, now seen corresponding path program 1 times [2023-12-15 20:29:24,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:29:24,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395945646] [2023-12-15 20:29:24,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:29:24,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:29:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:29:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:29:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:29:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:29:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:29:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:29:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:24,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:29:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:25,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:29:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:25,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:29:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:25,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:29:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:25,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:29:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:25,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:29:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:25,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:29:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:25,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:29:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:25,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:29:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:25,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:29:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:25,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 20:29:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:25,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 20:29:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:25,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 20:29:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:25,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 20:29:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:25,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-15 20:29:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:25,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-15 20:29:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:29:25,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:29:25,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395945646] [2023-12-15 20:29:25,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395945646] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:29:25,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:29:25,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 20:29:25,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244004827] [2023-12-15 20:29:25,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:29:25,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 20:29:25,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:29:25,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 20:29:25,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-15 20:29:25,114 INFO L87 Difference]: Start difference. First operand 342 states and 483 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-15 20:29:25,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:29:25,797 INFO L93 Difference]: Finished difference Result 689 states and 970 transitions. [2023-12-15 20:29:25,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 20:29:25,798 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 157 [2023-12-15 20:29:25,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:29:25,800 INFO L225 Difference]: With dead ends: 689 [2023-12-15 20:29:25,800 INFO L226 Difference]: Without dead ends: 532 [2023-12-15 20:29:25,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2023-12-15 20:29:25,801 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 439 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 20:29:25,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1622 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 20:29:25,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2023-12-15 20:29:25,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 392. [2023-12-15 20:29:25,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 318 states have (on average 1.3081761006289307) internal successors, (416), 320 states have internal predecessors, (416), 68 states have call successors, (68), 5 states have call predecessors, (68), 5 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-15 20:29:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 552 transitions. [2023-12-15 20:29:25,850 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 552 transitions. Word has length 157 [2023-12-15 20:29:25,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:29:25,851 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 552 transitions. [2023-12-15 20:29:25,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-15 20:29:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 552 transitions. [2023-12-15 20:29:25,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-15 20:29:25,852 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:29:25,852 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:29:25,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 20:29:25,852 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:29:25,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:29:25,853 INFO L85 PathProgramCache]: Analyzing trace with hash 691815049, now seen corresponding path program 1 times [2023-12-15 20:29:25,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:29:25,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423870880] [2023-12-15 20:29:25,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:29:25,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:29:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:26,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:29:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:26,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:29:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:26,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:29:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:26,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:29:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:26,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:29:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:26,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:29:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:26,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:29:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:26,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:29:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:26,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:29:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:26,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:29:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:26,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:29:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:26,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:29:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:26,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:29:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:26,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:29:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:26,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:29:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:26,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:29:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:26,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 20:29:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:26,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 20:29:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:26,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 20:29:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:26,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 20:29:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:26,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-15 20:29:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:26,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-15 20:29:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:26,281 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:29:26,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:29:26,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423870880] [2023-12-15 20:29:26,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423870880] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:29:26,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:29:26,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-15 20:29:26,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115559599] [2023-12-15 20:29:26,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:29:26,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 20:29:26,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:29:26,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 20:29:26,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-12-15 20:29:26,283 INFO L87 Difference]: Start difference. First operand 392 states and 552 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:28,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:29:28,303 INFO L93 Difference]: Finished difference Result 1729 states and 2427 transitions. [2023-12-15 20:29:28,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-15 20:29:28,304 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2023-12-15 20:29:28,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:29:28,309 INFO L225 Difference]: With dead ends: 1729 [2023-12-15 20:29:28,309 INFO L226 Difference]: Without dead ends: 1518 [2023-12-15 20:29:28,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=347, Invalid=1135, Unknown=0, NotChecked=0, Total=1482 [2023-12-15 20:29:28,310 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 1241 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 706 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 1850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 706 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:29:28,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 1143 Invalid, 1850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [706 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-15 20:29:28,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2023-12-15 20:29:28,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 697. [2023-12-15 20:29:28,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 573 states have (on average 1.2984293193717278) internal successors, (744), 577 states have internal predecessors, (744), 114 states have call successors, (114), 9 states have call predecessors, (114), 9 states have return successors, (114), 110 states have call predecessors, (114), 114 states have call successors, (114) [2023-12-15 20:29:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 972 transitions. [2023-12-15 20:29:28,466 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 972 transitions. Word has length 157 [2023-12-15 20:29:28,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:29:28,466 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 972 transitions. [2023-12-15 20:29:28,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:28,466 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 972 transitions. [2023-12-15 20:29:28,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-15 20:29:28,468 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:29:28,468 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:29:28,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 20:29:28,468 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:29:28,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:29:28,468 INFO L85 PathProgramCache]: Analyzing trace with hash -117531577, now seen corresponding path program 1 times [2023-12-15 20:29:28,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:29:28,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363408405] [2023-12-15 20:29:28,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:29:28,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:29:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:28,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:29:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:28,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:29:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:28,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:29:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:28,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:29:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:28,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:29:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:28,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:29:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:28,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:29:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:28,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:29:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:28,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:29:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:28,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:29:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:28,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:29:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:28,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:29:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:28,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:29:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:28,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:29:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:28,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:29:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:28,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:29:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:28,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 20:29:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:28,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 20:29:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:28,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 20:29:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:28,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 20:29:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:28,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-15 20:29:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:28,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-15 20:29:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:28,890 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:29:28,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:29:28,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363408405] [2023-12-15 20:29:28,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363408405] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:29:28,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:29:28,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 20:29:28,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75235260] [2023-12-15 20:29:28,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:29:28,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 20:29:28,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:29:28,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 20:29:28,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:29:28,892 INFO L87 Difference]: Start difference. First operand 697 states and 972 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-15 20:29:29,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:29:29,425 INFO L93 Difference]: Finished difference Result 1059 states and 1491 transitions. [2023-12-15 20:29:29,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 20:29:29,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 157 [2023-12-15 20:29:29,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:29:29,428 INFO L225 Difference]: With dead ends: 1059 [2023-12-15 20:29:29,428 INFO L226 Difference]: Without dead ends: 666 [2023-12-15 20:29:29,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-12-15 20:29:29,429 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 218 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 20:29:29,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 586 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 20:29:29,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2023-12-15 20:29:29,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 645. [2023-12-15 20:29:29,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 521 states have (on average 1.293666026871401) internal successors, (674), 525 states have internal predecessors, (674), 114 states have call successors, (114), 9 states have call predecessors, (114), 9 states have return successors, (114), 110 states have call predecessors, (114), 114 states have call successors, (114) [2023-12-15 20:29:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 902 transitions. [2023-12-15 20:29:29,550 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 902 transitions. Word has length 157 [2023-12-15 20:29:29,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:29:29,550 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 902 transitions. [2023-12-15 20:29:29,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-15 20:29:29,550 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 902 transitions. [2023-12-15 20:29:29,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-15 20:29:29,552 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:29:29,552 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:29:29,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 20:29:29,552 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:29:29,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:29:29,552 INFO L85 PathProgramCache]: Analyzing trace with hash -240359867, now seen corresponding path program 1 times [2023-12-15 20:29:29,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:29:29,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264763915] [2023-12-15 20:29:29,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:29:29,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:29:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:29,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:29:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:29,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:29:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:29,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:29:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:29,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:29:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:29,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:29:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:29,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:29:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:29,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:29:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:29,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:29:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:29,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:29:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:29,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:29:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:29,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:29:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:29,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:29:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:29,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:29:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:29,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:29:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:29,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:29:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:29,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:29:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:29,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 20:29:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:29,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 20:29:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:29,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 20:29:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:29,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 20:29:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:29,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-15 20:29:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:29,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-15 20:29:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:29,771 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:29:29,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:29:29,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264763915] [2023-12-15 20:29:29,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264763915] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:29:29,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:29:29,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 20:29:29,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630693579] [2023-12-15 20:29:29,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:29:29,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 20:29:29,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:29:29,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 20:29:29,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:29:29,772 INFO L87 Difference]: Start difference. First operand 645 states and 902 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:30,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:29:30,704 INFO L93 Difference]: Finished difference Result 2018 states and 2812 transitions. [2023-12-15 20:29:30,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 20:29:30,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2023-12-15 20:29:30,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:29:30,711 INFO L225 Difference]: With dead ends: 2018 [2023-12-15 20:29:30,711 INFO L226 Difference]: Without dead ends: 1827 [2023-12-15 20:29:30,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2023-12-15 20:29:30,715 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 588 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 20:29:30,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 1052 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 20:29:30,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2023-12-15 20:29:30,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 396. [2023-12-15 20:29:30,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 322 states have (on average 1.3043478260869565) internal successors, (420), 324 states have internal predecessors, (420), 68 states have call successors, (68), 5 states have call predecessors, (68), 5 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-15 20:29:30,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 556 transitions. [2023-12-15 20:29:30,817 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 556 transitions. Word has length 157 [2023-12-15 20:29:30,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:29:30,817 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 556 transitions. [2023-12-15 20:29:30,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:30,817 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 556 transitions. [2023-12-15 20:29:30,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-15 20:29:30,818 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:29:30,818 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:29:30,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 20:29:30,818 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:29:30,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:29:30,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1049706493, now seen corresponding path program 1 times [2023-12-15 20:29:30,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:29:30,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136400777] [2023-12-15 20:29:30,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:29:30,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:29:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:29:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:29:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:29:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:29:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:29:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:29:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:29:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:29:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:29:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:29:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:29:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:29:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:29:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:29:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:29:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:29:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 20:29:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 20:29:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 20:29:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 20:29:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-15 20:29:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-15 20:29:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,096 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:29:31,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:29:31,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136400777] [2023-12-15 20:29:31,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136400777] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:29:31,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:29:31,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 20:29:31,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139208035] [2023-12-15 20:29:31,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:29:31,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 20:29:31,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:29:31,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 20:29:31,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-15 20:29:31,099 INFO L87 Difference]: Start difference. First operand 396 states and 556 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:31,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:29:31,394 INFO L93 Difference]: Finished difference Result 691 states and 956 transitions. [2023-12-15 20:29:31,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-15 20:29:31,394 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2023-12-15 20:29:31,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:29:31,396 INFO L225 Difference]: With dead ends: 691 [2023-12-15 20:29:31,396 INFO L226 Difference]: Without dead ends: 500 [2023-12-15 20:29:31,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-15 20:29:31,397 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 90 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:29:31,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 614 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:29:31,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2023-12-15 20:29:31,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 380. [2023-12-15 20:29:31,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 306 states have (on average 1.3137254901960784) internal successors, (402), 308 states have internal predecessors, (402), 68 states have call successors, (68), 5 states have call predecessors, (68), 5 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-15 20:29:31,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 538 transitions. [2023-12-15 20:29:31,468 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 538 transitions. Word has length 157 [2023-12-15 20:29:31,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:29:31,468 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 538 transitions. [2023-12-15 20:29:31,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:31,468 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 538 transitions. [2023-12-15 20:29:31,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-15 20:29:31,469 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:29:31,469 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:29:31,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 20:29:31,469 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:29:31,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:29:31,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1748789732, now seen corresponding path program 1 times [2023-12-15 20:29:31,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:29:31,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748649598] [2023-12-15 20:29:31,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:29:31,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:29:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:29:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:29:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:29:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:29:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:29:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:29:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:29:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:29:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:29:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:29:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:29:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:29:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:29:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:29:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:29:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:29:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 20:29:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 20:29:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 20:29:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 20:29:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-15 20:29:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-15 20:29:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:31,792 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:29:31,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:29:31,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748649598] [2023-12-15 20:29:31,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748649598] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:29:31,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:29:31,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 20:29:31,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136950221] [2023-12-15 20:29:31,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:29:31,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 20:29:31,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:29:31,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 20:29:31,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 20:29:31,794 INFO L87 Difference]: Start difference. First operand 380 states and 538 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:32,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:29:32,037 INFO L93 Difference]: Finished difference Result 758 states and 1063 transitions. [2023-12-15 20:29:32,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 20:29:32,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2023-12-15 20:29:32,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:29:32,039 INFO L225 Difference]: With dead ends: 758 [2023-12-15 20:29:32,039 INFO L226 Difference]: Without dead ends: 622 [2023-12-15 20:29:32,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-15 20:29:32,040 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 166 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:29:32,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 552 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:29:32,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2023-12-15 20:29:32,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 487. [2023-12-15 20:29:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 410 states have (on average 1.3390243902439025) internal successors, (549), 413 states have internal predecessors, (549), 70 states have call successors, (70), 6 states have call predecessors, (70), 6 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2023-12-15 20:29:32,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 689 transitions. [2023-12-15 20:29:32,115 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 689 transitions. Word has length 157 [2023-12-15 20:29:32,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:29:32,115 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 689 transitions. [2023-12-15 20:29:32,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:32,115 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 689 transitions. [2023-12-15 20:29:32,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-15 20:29:32,116 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:29:32,116 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:29:32,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 20:29:32,117 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:29:32,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:29:32,117 INFO L85 PathProgramCache]: Analyzing trace with hash 468926054, now seen corresponding path program 1 times [2023-12-15 20:29:32,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:29:32,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132475993] [2023-12-15 20:29:32,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:29:32,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:29:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:29:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:29:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:29:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:29:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:29:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:29:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:29:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:29:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:29:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:29:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:29:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:29:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:29:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:29:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:29:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:29:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 20:29:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 20:29:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 20:29:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 20:29:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-15 20:29:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-15 20:29:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,357 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:29:32,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:29:32,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132475993] [2023-12-15 20:29:32,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132475993] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:29:32,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:29:32,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 20:29:32,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948073916] [2023-12-15 20:29:32,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:29:32,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 20:29:32,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:29:32,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 20:29:32,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:29:32,359 INFO L87 Difference]: Start difference. First operand 487 states and 689 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:32,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:29:32,682 INFO L93 Difference]: Finished difference Result 844 states and 1207 transitions. [2023-12-15 20:29:32,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 20:29:32,682 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2023-12-15 20:29:32,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:29:32,684 INFO L225 Difference]: With dead ends: 844 [2023-12-15 20:29:32,684 INFO L226 Difference]: Without dead ends: 601 [2023-12-15 20:29:32,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-15 20:29:32,685 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 111 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:29:32,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1027 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:29:32,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2023-12-15 20:29:32,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 511. [2023-12-15 20:29:32,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 434 states have (on average 1.3387096774193548) internal successors, (581), 437 states have internal predecessors, (581), 70 states have call successors, (70), 6 states have call predecessors, (70), 6 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2023-12-15 20:29:32,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 721 transitions. [2023-12-15 20:29:32,768 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 721 transitions. Word has length 157 [2023-12-15 20:29:32,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:29:32,768 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 721 transitions. [2023-12-15 20:29:32,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:32,768 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 721 transitions. [2023-12-15 20:29:32,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-15 20:29:32,769 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:29:32,770 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:29:32,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-15 20:29:32,770 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:29:32,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:29:32,770 INFO L85 PathProgramCache]: Analyzing trace with hash 727091492, now seen corresponding path program 1 times [2023-12-15 20:29:32,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:29:32,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001766526] [2023-12-15 20:29:32,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:29:32,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:29:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:29:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:29:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:29:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:29:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:29:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:29:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:29:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:29:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:29:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:29:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:29:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:29:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:29:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:29:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:29:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:29:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 20:29:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 20:29:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 20:29:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 20:29:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-15 20:29:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-15 20:29:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:29:32,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:29:32,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001766526] [2023-12-15 20:29:32,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001766526] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:29:32,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:29:32,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:29:32,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354845957] [2023-12-15 20:29:32,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:29:32,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:29:32,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:29:32,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:29:32,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:29:32,827 INFO L87 Difference]: Start difference. First operand 511 states and 721 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:32,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:29:32,994 INFO L93 Difference]: Finished difference Result 1027 states and 1445 transitions. [2023-12-15 20:29:32,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:29:32,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2023-12-15 20:29:32,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:29:32,997 INFO L225 Difference]: With dead ends: 1027 [2023-12-15 20:29:32,997 INFO L226 Difference]: Without dead ends: 760 [2023-12-15 20:29:32,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-15 20:29:32,998 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 114 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:29:32,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 251 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:29:32,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2023-12-15 20:29:33,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 539. [2023-12-15 20:29:33,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 462 states have (on average 1.3225108225108224) internal successors, (611), 465 states have internal predecessors, (611), 70 states have call successors, (70), 6 states have call predecessors, (70), 6 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2023-12-15 20:29:33,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 751 transitions. [2023-12-15 20:29:33,082 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 751 transitions. Word has length 157 [2023-12-15 20:29:33,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:29:33,082 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 751 transitions. [2023-12-15 20:29:33,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:33,082 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 751 transitions. [2023-12-15 20:29:33,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-15 20:29:33,084 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:29:33,084 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:29:33,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-15 20:29:33,084 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:29:33,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:29:33,084 INFO L85 PathProgramCache]: Analyzing trace with hash 784349794, now seen corresponding path program 1 times [2023-12-15 20:29:33,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:29:33,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25250153] [2023-12-15 20:29:33,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:29:33,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:29:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:29:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:29:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:29:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:29:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:29:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:29:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:29:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:29:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:29:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:29:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:29:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:29:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:29:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:29:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:29:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:29:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 20:29:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 20:29:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 20:29:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 20:29:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-15 20:29:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-15 20:29:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,214 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:29:33,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:29:33,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25250153] [2023-12-15 20:29:33,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25250153] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:29:33,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:29:33,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 20:29:33,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554963818] [2023-12-15 20:29:33,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:29:33,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 20:29:33,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:29:33,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 20:29:33,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 20:29:33,216 INFO L87 Difference]: Start difference. First operand 539 states and 751 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:33,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:29:33,422 INFO L93 Difference]: Finished difference Result 905 states and 1273 transitions. [2023-12-15 20:29:33,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 20:29:33,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2023-12-15 20:29:33,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:29:33,424 INFO L225 Difference]: With dead ends: 905 [2023-12-15 20:29:33,424 INFO L226 Difference]: Without dead ends: 610 [2023-12-15 20:29:33,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 20:29:33,425 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 245 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:29:33,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 272 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:29:33,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2023-12-15 20:29:33,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 507. [2023-12-15 20:29:33,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 430 states have (on average 1.3046511627906976) internal successors, (561), 433 states have internal predecessors, (561), 70 states have call successors, (70), 6 states have call predecessors, (70), 6 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2023-12-15 20:29:33,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 701 transitions. [2023-12-15 20:29:33,519 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 701 transitions. Word has length 157 [2023-12-15 20:29:33,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:29:33,519 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 701 transitions. [2023-12-15 20:29:33,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:33,520 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 701 transitions. [2023-12-15 20:29:33,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-15 20:29:33,521 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:29:33,521 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:29:33,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-15 20:29:33,521 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:29:33,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:29:33,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1043145118, now seen corresponding path program 1 times [2023-12-15 20:29:33,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:29:33,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573314967] [2023-12-15 20:29:33,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:29:33,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:29:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:29:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:29:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:29:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:29:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:29:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:29:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:29:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:29:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:29:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:29:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:29:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:29:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:29:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:29:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:29:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:29:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 20:29:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 20:29:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 20:29:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 20:29:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-15 20:29:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-15 20:29:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:33,764 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:29:33,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:29:33,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573314967] [2023-12-15 20:29:33,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573314967] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:29:33,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:29:33,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:29:33,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010614478] [2023-12-15 20:29:33,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:29:33,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:29:33,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:29:33,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:29:33,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:29:33,766 INFO L87 Difference]: Start difference. First operand 507 states and 701 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:33,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:29:33,968 INFO L93 Difference]: Finished difference Result 1119 states and 1529 transitions. [2023-12-15 20:29:33,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 20:29:33,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2023-12-15 20:29:33,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:29:33,970 INFO L225 Difference]: With dead ends: 1119 [2023-12-15 20:29:33,970 INFO L226 Difference]: Without dead ends: 671 [2023-12-15 20:29:33,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:29:33,971 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 144 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:29:33,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 426 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:29:33,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2023-12-15 20:29:34,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 491. [2023-12-15 20:29:34,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 414 states have (on average 1.3019323671497585) internal successors, (539), 417 states have internal predecessors, (539), 70 states have call successors, (70), 6 states have call predecessors, (70), 6 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2023-12-15 20:29:34,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 679 transitions. [2023-12-15 20:29:34,060 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 679 transitions. Word has length 157 [2023-12-15 20:29:34,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:29:34,060 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 679 transitions. [2023-12-15 20:29:34,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:34,060 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 679 transitions. [2023-12-15 20:29:34,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-15 20:29:34,061 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:29:34,061 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:29:34,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-15 20:29:34,062 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:29:34,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:29:34,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1465846944, now seen corresponding path program 1 times [2023-12-15 20:29:34,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:29:34,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038443825] [2023-12-15 20:29:34,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:29:34,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:29:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:34,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:29:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:34,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:29:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:34,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:29:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:34,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:29:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:34,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:29:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:34,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:29:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:34,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:29:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:34,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:29:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:34,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:29:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:34,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:29:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:34,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:29:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:34,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:29:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:34,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:29:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:34,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:29:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:34,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:29:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:34,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:29:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:34,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 20:29:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:34,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 20:29:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:34,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 20:29:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:34,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 20:29:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:34,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-15 20:29:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:34,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-15 20:29:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:29:34,391 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:29:34,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:29:34,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038443825] [2023-12-15 20:29:34,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038443825] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:29:34,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:29:34,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 20:29:34,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876633039] [2023-12-15 20:29:34,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:29:34,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 20:29:34,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:29:34,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 20:29:34,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-15 20:29:34,393 INFO L87 Difference]: Start difference. First operand 491 states and 679 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:35,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:29:35,294 INFO L93 Difference]: Finished difference Result 1229 states and 1689 transitions. [2023-12-15 20:29:35,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 20:29:35,294 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2023-12-15 20:29:35,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:29:35,297 INFO L225 Difference]: With dead ends: 1229 [2023-12-15 20:29:35,297 INFO L226 Difference]: Without dead ends: 966 [2023-12-15 20:29:35,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2023-12-15 20:29:35,298 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 378 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 20:29:35,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1069 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-15 20:29:35,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2023-12-15 20:29:35,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 758. [2023-12-15 20:29:35,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 655 states have (on average 1.3083969465648855) internal successors, (857), 659 states have internal predecessors, (857), 94 states have call successors, (94), 8 states have call predecessors, (94), 8 states have return successors, (94), 90 states have call predecessors, (94), 94 states have call successors, (94) [2023-12-15 20:29:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1045 transitions. [2023-12-15 20:29:35,419 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1045 transitions. Word has length 157 [2023-12-15 20:29:35,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:29:35,419 INFO L495 AbstractCegarLoop]: Abstraction has 758 states and 1045 transitions. [2023-12-15 20:29:35,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:29:35,420 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1045 transitions. [2023-12-15 20:29:35,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-15 20:29:35,421 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:29:35,421 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:29:35,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-15 20:29:35,421 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:29:35,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:29:35,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1688908782, now seen corresponding path program 1 times [2023-12-15 20:29:35,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:29:35,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744822137] [2023-12-15 20:29:35,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:29:35,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:29:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:29:35,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 20:29:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:29:35,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 20:29:35,602 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 20:29:35,602 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 20:29:35,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-15 20:29:35,606 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:29:35,608 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 20:29:35,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:29:35 BoogieIcfgContainer [2023-12-15 20:29:35,697 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 20:29:35,697 INFO L158 Benchmark]: Toolchain (without parser) took 20421.55ms. Allocated memory was 262.1MB in the beginning and 630.2MB in the end (delta: 368.1MB). Free memory was 208.8MB in the beginning and 277.4MB in the end (delta: -68.7MB). Peak memory consumption was 300.9MB. Max. memory is 8.0GB. [2023-12-15 20:29:35,697 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 185.6MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:29:35,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.60ms. Allocated memory is still 262.1MB. Free memory was 208.8MB in the beginning and 192.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-15 20:29:35,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.05ms. Allocated memory is still 262.1MB. Free memory was 192.4MB in the beginning and 187.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 20:29:35,702 INFO L158 Benchmark]: Boogie Preprocessor took 40.94ms. Allocated memory is still 262.1MB. Free memory was 187.8MB in the beginning and 181.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-15 20:29:35,702 INFO L158 Benchmark]: RCFGBuilder took 589.75ms. Allocated memory is still 262.1MB. Free memory was 181.5MB in the beginning and 219.6MB in the end (delta: -38.2MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2023-12-15 20:29:35,702 INFO L158 Benchmark]: TraceAbstraction took 19429.81ms. Allocated memory was 262.1MB in the beginning and 630.2MB in the end (delta: 368.1MB). Free memory was 219.1MB in the beginning and 277.4MB in the end (delta: -58.3MB). Peak memory consumption was 311.3MB. Max. memory is 8.0GB. [2023-12-15 20:29:35,704 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.55ms. Allocated memory is still 185.6MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 307.60ms. Allocated memory is still 262.1MB. Free memory was 208.8MB in the beginning and 192.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.05ms. Allocated memory is still 262.1MB. Free memory was 192.4MB in the beginning and 187.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.94ms. Allocated memory is still 262.1MB. Free memory was 187.8MB in the beginning and 181.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 589.75ms. Allocated memory is still 262.1MB. Free memory was 181.5MB in the beginning and 219.6MB in the end (delta: -38.2MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 19429.81ms. Allocated memory was 262.1MB in the beginning and 630.2MB in the end (delta: 368.1MB). Free memory was 219.1MB in the beginning and 277.4MB in the end (delta: -58.3MB). Peak memory consumption was 311.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of shiftRight at line 182, overapproximation of someBinaryArithmeticDOUBLEoperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 182. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] unsigned char var_1_33 = 8; [L44] double var_1_40 = 8.35; [L45] unsigned short int var_1_45 = 50; [L46] unsigned char var_1_46 = 0; [L47] unsigned char var_1_47 = 5; [L48] unsigned char var_1_48 = 1; [L49] signed char var_1_49 = -16; [L50] signed char var_1_50 = 2; [L51] signed char var_1_51 = 16; [L52] signed long int var_1_53 = 256; [L53] double var_1_54 = 1.25; [L54] unsigned long int var_1_55 = 5; [L55] signed long int last_1_var_1_1 = 64; [L56] unsigned char last_1_var_1_13 = 64; [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] CALL updateLastVariables() [L178] last_1_var_1_1 = var_1_1 [L179] last_1_var_1_13 = var_1_13 [L189] RET updateLastVariables() [L190] CALL updateVariables() [L140] var_1_7 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5] [L141] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5] [L142] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L142] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L143] var_1_15 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L144] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L145] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L145] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L146] var_1_16 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L147] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L148] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L148] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L149] var_1_18 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L150] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L151] var_1_19 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L152] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L153] var_1_20 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L154] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L155] var_1_21 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L156] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L157] var_1_22 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L158] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L159] var_1_23 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L160] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L161] var_1_27 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L162] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L163] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L163] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L164] var_1_28 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L165] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L166] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L166] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L167] var_1_47 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_47 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L168] RET assume_abort_if_not(var_1_47 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L169] CALL assume_abort_if_not(var_1_47 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L169] RET assume_abort_if_not(var_1_47 <= 127) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L170] var_1_50 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_50 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L171] RET assume_abort_if_not(var_1_50 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L172] CALL assume_abort_if_not(var_1_50 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L172] RET assume_abort_if_not(var_1_50 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L173] var_1_51 = __VERIFIER_nondet_char() [L174] CALL assume_abort_if_not(var_1_51 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L174] RET assume_abort_if_not(var_1_51 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L175] CALL assume_abort_if_not(var_1_51 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L175] RET assume_abort_if_not(var_1_51 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L190] RET updateVariables() [L191] CALL step() [L60] EXPR var_1_15 ^ var_1_1 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L60] EXPR var_1_13 | var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L60] COND FALSE !((var_1_15 ^ var_1_1) < (var_1_13 | var_1_13)) [L63] var_1_33 = (((((((var_1_16) < (var_1_16)) ? (var_1_16) : (var_1_16))) < 0 ) ? -((((var_1_16) < (var_1_16)) ? (var_1_16) : (var_1_16))) : ((((var_1_16) < (var_1_16)) ? (var_1_16) : (var_1_16))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=68, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L65] COND FALSE !((-32 & var_1_16) > var_1_32) [L68] var_1_40 = (var_1_18 + var_1_18) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L70] COND FALSE !(var_1_21 >= ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L77] COND FALSE !(var_1_21 <= (var_1_20 + var_1_19)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L81] COND FALSE !(var_1_18 > (var_1_19 + var_1_22)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L88] var_1_48 = var_1_16 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L89] COND TRUE var_1_20 < var_1_22 [L90] var_1_49 = ((var_1_50 - var_1_51) + var_1_27) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L94] var_1_53 = var_1_11 [L95] var_1_54 = var_1_21 [L96] var_1_55 = var_1_11 [L97] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_53=500, var_1_54=505, var_1_55=500, var_1_7=0] [L98] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_53=500, var_1_54=505, var_1_55=500, var_1_7=0] [L101] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_53=500, var_1_54=505, var_1_55=500, var_1_7=0] [L102] COND FALSE !(\read(var_1_7)) [L105] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=64, var_1_21=505, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_53=500, var_1_54=505, var_1_55=500, var_1_7=0] [L107] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=64, var_1_21=505, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_53=500, var_1_54=505, var_1_55=500, var_1_7=0] [L110] var_1_32 = var_1_16 [L111] var_1_30 = var_1_32 [L112] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=64, var_1_21=505, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_53=500, var_1_54=505, var_1_55=500, var_1_7=0] [L113] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=64, var_1_21=505, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_53=500, var_1_54=505, var_1_55=500, var_1_7=0] [L113] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L114] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=64, var_1_21=505, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_53=500, var_1_54=505, var_1_55=500, var_1_7=0] [L116] COND TRUE var_1_11 >= var_1_30 [L117] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=64, var_1_21=505, var_1_22=506, var_1_24=10, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_53=500, var_1_54=505, var_1_55=500, var_1_7=0] [L119] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=64, var_1_21=505, var_1_22=506, var_1_24=10, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_53=500, var_1_54=505, var_1_55=500, var_1_7=0] [L119] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L120] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=68, var_1_21=505, var_1_22=506, var_1_24=10, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_53=500, var_1_54=505, var_1_55=500, var_1_7=0] [L128] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=68, var_1_21=505, var_1_22=506, var_1_24=10, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_53=500, var_1_54=505, var_1_55=500, var_1_7=0] [L129] COND TRUE ! var_1_7 [L130] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=68, var_1_21=505, var_1_22=506, var_1_24=0, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_53=500, var_1_54=505, var_1_55=500, var_1_7=0] [L191] RET step() [L192] CALL, EXPR property() [L182] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=68, var_1_21=505, var_1_22=506, var_1_24=0, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_53=500, var_1_54=505, var_1_55=500, var_1_7=0] [L182] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=68, var_1_21=505, var_1_22=506, var_1_24=0, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_53=500, var_1_54=505, var_1_55=500, var_1_7=0] [L182] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=68, var_1_21=505, var_1_22=506, var_1_24=0, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_53=500, var_1_54=505, var_1_55=500, var_1_7=0] [L182] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=68, var_1_21=505, var_1_22=506, var_1_24=0, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_53=500, var_1_54=505, var_1_55=500, var_1_7=0] [L182-L183] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=68, var_1_21=505, var_1_22=506, var_1_24=0, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_53=500, var_1_54=505, var_1_55=500, var_1_7=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=68, var_1_21=505, var_1_22=506, var_1_24=0, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_53=500, var_1_54=505, var_1_55=500, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.3s, OverallIterations: 23, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5705 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5705 mSDsluCounter, 15969 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11761 mSDsCounter, 1530 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6887 IncrementalHoareTripleChecker+Invalid, 8417 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1530 mSolverCounterUnsat, 4208 mSDtfsCounter, 6887 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1288 GetRequests, 1072 SyntacticMatches, 2 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=758occurred in iteration=22, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 4424 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 3596 NumberOfCodeBlocks, 3596 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3417 ConstructedInterpolants, 0 QuantifiedInterpolants, 13801 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 20328/20328 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 could not prove your program: unable to determine feasibility of some traces [2023-12-15 20:29:35,736 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...