/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 19:14:49,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 19:14:49,198 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-20 19:14:49,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 19:14:49,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 19:14:49,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 19:14:49,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 19:14:49,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 19:14:49,236 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 19:14:49,241 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 19:14:49,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 19:14:49,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 19:14:49,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 19:14:49,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 19:14:49,244 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 19:14:49,244 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 19:14:49,245 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 19:14:49,245 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 19:14:49,245 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 19:14:49,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 19:14:49,246 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 19:14:49,252 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 19:14:49,252 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 19:14:49,252 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 19:14:49,253 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 19:14:49,253 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 19:14:49,253 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 19:14:49,253 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 19:14:49,254 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 19:14:49,254 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 19:14:49,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 19:14:49,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 19:14:49,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 19:14:49,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 19:14:49,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 19:14:49,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 19:14:49,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 19:14:49,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 19:14:49,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 19:14:49,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 19:14:49,257 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 19:14:49,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 19:14:49,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 19:14:49,258 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-20 19:14:49,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 19:14:49,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 19:14:49,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 19:14:49,501 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 19:14:49,503 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 19:14:49,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.i [2023-12-20 19:14:50,610 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 19:14:50,799 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 19:14:50,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.i [2023-12-20 19:14:50,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d744dffec/f4358197b3bc4d64a36664ac30d2bb7b/FLAGf77cf614d [2023-12-20 19:14:50,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d744dffec/f4358197b3bc4d64a36664ac30d2bb7b [2023-12-20 19:14:50,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 19:14:50,822 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 19:14:50,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 19:14:50,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 19:14:50,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 19:14:50,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 07:14:50" (1/1) ... [2023-12-20 19:14:50,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13716da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:14:50, skipping insertion in model container [2023-12-20 19:14:50,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 07:14:50" (1/1) ... [2023-12-20 19:14:50,856 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 19:14:50,983 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_fillercodesize_ps-cn-10_file-10.i[915,928] [2023-12-20 19:14:51,038 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 19:14:51,047 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 19:14:51,057 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_fillercodesize_ps-cn-10_file-10.i[915,928] [2023-12-20 19:14:51,085 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 19:14:51,099 INFO L206 MainTranslator]: Completed translation [2023-12-20 19:14:51,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:14:51 WrapperNode [2023-12-20 19:14:51,099 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 19:14:51,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 19:14:51,101 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 19:14:51,101 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 19:14:51,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:14:51" (1/1) ... [2023-12-20 19:14:51,116 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:14:51" (1/1) ... [2023-12-20 19:14:51,155 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2023-12-20 19:14:51,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 19:14:51,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 19:14:51,157 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 19:14:51,157 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 19:14:51,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:14:51" (1/1) ... [2023-12-20 19:14:51,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:14:51" (1/1) ... [2023-12-20 19:14:51,171 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:14:51" (1/1) ... [2023-12-20 19:14:51,187 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-20 19:14:51,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:14:51" (1/1) ... [2023-12-20 19:14:51,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:14:51" (1/1) ... [2023-12-20 19:14:51,198 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:14:51" (1/1) ... [2023-12-20 19:14:51,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:14:51" (1/1) ... [2023-12-20 19:14:51,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:14:51" (1/1) ... [2023-12-20 19:14:51,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:14:51" (1/1) ... [2023-12-20 19:14:51,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 19:14:51,217 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 19:14:51,218 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 19:14:51,218 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 19:14:51,218 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:14:51" (1/1) ... [2023-12-20 19:14:51,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 19:14:51,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 19:14:51,256 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-20 19:14:51,272 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-20 19:14:51,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 19:14:51,292 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 19:14:51,292 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 19:14:51,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 19:14:51,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 19:14:51,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 19:14:51,391 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 19:14:51,394 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 19:14:51,758 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 19:14:51,800 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 19:14:51,801 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 19:14:51,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 07:14:51 BoogieIcfgContainer [2023-12-20 19:14:51,801 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 19:14:51,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 19:14:51,803 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 19:14:51,811 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 19:14:51,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 07:14:50" (1/3) ... [2023-12-20 19:14:51,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3697683f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 07:14:51, skipping insertion in model container [2023-12-20 19:14:51,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:14:51" (2/3) ... [2023-12-20 19:14:51,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3697683f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 07:14:51, skipping insertion in model container [2023-12-20 19:14:51,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 07:14:51" (3/3) ... [2023-12-20 19:14:51,815 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-10.i [2023-12-20 19:14:51,830 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 19:14:51,830 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 19:14:51,876 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 19:14:51,883 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@60edb680, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 19:14:51,883 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 19:14:51,887 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 46 states have internal predecessors, (64), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-20 19:14:51,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-20 19:14:51,909 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:14:51,909 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 19:14:51,910 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:14:51,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:14:51,913 INFO L85 PathProgramCache]: Analyzing trace with hash 639929432, now seen corresponding path program 1 times [2023-12-20 19:14:51,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:14:51,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592209816] [2023-12-20 19:14:51,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:14:51,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:14:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:14:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:14:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:14:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:14:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:14:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:14:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:14:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:14:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:14:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:14:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:14:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:14:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:14:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:14:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:14:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:14:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:14:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:14:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:14:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 19:14:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 19:14:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:14:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-20 19:14:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:14:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-20 19:14:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-20 19:14:52,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:14:52,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592209816] [2023-12-20 19:14:52,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592209816] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:14:52,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:14:52,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 19:14:52,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298723831] [2023-12-20 19:14:52,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:14:52,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 19:14:52,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:14:52,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 19:14:52,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 19:14:52,302 INFO L87 Difference]: Start difference. First operand has 73 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 46 states have internal predecessors, (64), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-20 19:14:52,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:14:52,340 INFO L93 Difference]: Finished difference Result 143 states and 251 transitions. [2023-12-20 19:14:52,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 19:14:52,342 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 159 [2023-12-20 19:14:52,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:14:52,352 INFO L225 Difference]: With dead ends: 143 [2023-12-20 19:14:52,352 INFO L226 Difference]: Without dead ends: 71 [2023-12-20 19:14:52,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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-20 19:14:52,358 INFO L413 NwaCegarLoop]: 106 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, 106 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-20 19:14:52,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 19:14:52,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-20 19:14:52,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-12-20 19:14:52,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-20 19:14:52,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 109 transitions. [2023-12-20 19:14:52,408 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 109 transitions. Word has length 159 [2023-12-20 19:14:52,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:14:52,409 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 109 transitions. [2023-12-20 19:14:52,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-20 19:14:52,409 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 109 transitions. [2023-12-20 19:14:52,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-20 19:14:52,413 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:14:52,413 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 19:14:52,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 19:14:52,414 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:14:52,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:14:52,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1095343782, now seen corresponding path program 1 times [2023-12-20 19:14:52,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:14:52,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050296694] [2023-12-20 19:14:52,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:14:52,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:14:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:14:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:14:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:14:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:14:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:14:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:52,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:14:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:53,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:14:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:53,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:14:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:53,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:14:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:53,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:14:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:53,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:14:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:53,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:14:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:53,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:14:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:53,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:14:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:53,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:14:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:53,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:14:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:53,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:14:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:53,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:14:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:53,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:14:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:53,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 19:14:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:53,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 19:14:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:53,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:14:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:53,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-20 19:14:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:53,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:14:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:53,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-20 19:14:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:14:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-20 19:14:53,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:14:53,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050296694] [2023-12-20 19:14:53,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050296694] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:14:53,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:14:53,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 19:14:53,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308151263] [2023-12-20 19:14:53,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:14:53,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 19:14:53,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:14:53,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 19:14:53,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 19:14:53,117 INFO L87 Difference]: Start difference. First operand 71 states and 109 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 19:14:53,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:14:53,335 INFO L93 Difference]: Finished difference Result 212 states and 326 transitions. [2023-12-20 19:14:53,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 19:14:53,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 159 [2023-12-20 19:14:53,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:14:53,338 INFO L225 Difference]: With dead ends: 212 [2023-12-20 19:14:53,339 INFO L226 Difference]: Without dead ends: 142 [2023-12-20 19:14:53,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 19:14:53,341 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 66 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 19:14:53,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 305 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 19:14:53,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-12-20 19:14:53,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 118. [2023-12-20 19:14:53,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 65 states have internal predecessors, (82), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-20 19:14:53,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 182 transitions. [2023-12-20 19:14:53,365 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 182 transitions. Word has length 159 [2023-12-20 19:14:53,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:14:53,366 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 182 transitions. [2023-12-20 19:14:53,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 19:14:53,366 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 182 transitions. [2023-12-20 19:14:53,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-12-20 19:14:53,368 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:14:53,368 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 19:14:53,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 19:14:53,369 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:14:53,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:14:53,369 INFO L85 PathProgramCache]: Analyzing trace with hash -976445293, now seen corresponding path program 1 times [2023-12-20 19:14:53,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:14:53,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043647253] [2023-12-20 19:14:53,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:14:53,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:14:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:15:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:15:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:15:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:15:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:15:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:15:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:15:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:15:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:15:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:15:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:15:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:15:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:15:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:15:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:15:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:15:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:15:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:15:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:15:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 19:15:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 19:15:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:15:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-20 19:15:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:15:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-20 19:15:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:15:51,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-20 19:15:51,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:15:51,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043647253] [2023-12-20 19:15:51,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043647253] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:15:51,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:15:51,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-20 19:15:51,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095996668] [2023-12-20 19:15:51,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:15:51,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-20 19:15:51,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:15:51,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-20 19:15:51,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-12-20 19:15:51,905 INFO L87 Difference]: Start difference. First operand 118 states and 182 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-20 19:15:54,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:15:54,231 INFO L93 Difference]: Finished difference Result 324 states and 482 transitions. [2023-12-20 19:15:54,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-20 19:15:54,232 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 160 [2023-12-20 19:15:54,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:15:54,234 INFO L225 Difference]: With dead ends: 324 [2023-12-20 19:15:54,235 INFO L226 Difference]: Without dead ends: 254 [2023-12-20 19:15:54,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=233, Invalid=759, Unknown=0, NotChecked=0, Total=992 [2023-12-20 19:15:54,237 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 290 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-20 19:15:54,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 659 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-20 19:15:54,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-12-20 19:15:54,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 205. [2023-12-20 19:15:54,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 123 states have (on average 1.2601626016260163) internal successors, (155), 124 states have internal predecessors, (155), 75 states have call successors, (75), 6 states have call predecessors, (75), 6 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2023-12-20 19:15:54,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 305 transitions. [2023-12-20 19:15:54,266 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 305 transitions. Word has length 160 [2023-12-20 19:15:54,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:15:54,266 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 305 transitions. [2023-12-20 19:15:54,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-20 19:15:54,267 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 305 transitions. [2023-12-20 19:15:54,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-12-20 19:15:54,269 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:15:54,269 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 19:15:54,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 19:15:54,269 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:15:54,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:15:54,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1229311699, now seen corresponding path program 1 times [2023-12-20 19:15:54,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:15:54,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870186132] [2023-12-20 19:15:54,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:15:54,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:15:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:16:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:16:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:16:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:16:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:16:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:16:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:16:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:16:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:16:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:16:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:16:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:16:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:16:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:16:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:16:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:16:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:16:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:16:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:16:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 19:16:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 19:16:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:16:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-20 19:16:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:16:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-20 19:16:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:16:51,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-20 19:16:51,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:16:51,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870186132] [2023-12-20 19:16:51,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870186132] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:16:51,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:16:51,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-20 19:16:51,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589381655] [2023-12-20 19:16:51,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:16:51,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-20 19:16:51,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:16:51,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-20 19:16:51,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-20 19:16:51,959 INFO L87 Difference]: Start difference. First operand 205 states and 305 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 19:16:59,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:17:00,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:17:00,690 INFO L93 Difference]: Finished difference Result 409 states and 600 transitions. [2023-12-20 19:17:00,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-20 19:17:00,691 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 160 [2023-12-20 19:17:00,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:17:00,694 INFO L225 Difference]: With dead ends: 409 [2023-12-20 19:17:00,694 INFO L226 Difference]: Without dead ends: 251 [2023-12-20 19:17:00,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2023-12-20 19:17:00,696 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 183 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 79 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-12-20 19:17:00,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 514 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 358 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2023-12-20 19:17:00,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-12-20 19:17:00,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 207. [2023-12-20 19:17:00,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 125 states have (on average 1.256) internal successors, (157), 126 states have internal predecessors, (157), 75 states have call successors, (75), 6 states have call predecessors, (75), 6 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2023-12-20 19:17:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 307 transitions. [2023-12-20 19:17:00,724 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 307 transitions. Word has length 160 [2023-12-20 19:17:00,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:17:00,724 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 307 transitions. [2023-12-20 19:17:00,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 19:17:00,725 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 307 transitions. [2023-12-20 19:17:00,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-12-20 19:17:00,726 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:17:00,727 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 19:17:00,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 19:17:00,727 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:17:00,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:17:00,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1730174101, now seen corresponding path program 1 times [2023-12-20 19:17:00,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:17:00,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161140650] [2023-12-20 19:17:00,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:17:00,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:17:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,230 WARN L293 SmtUtils]: Spent 6.38s on a formula simplification. DAG size of input: 216 DAG size of output: 190 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 19:18:38,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:18:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:18:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:18:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:18:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:18:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:18:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:18:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:18:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:18:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:18:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:18:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:18:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:18:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:18:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:18:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:18:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:18:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:18:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:18:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 19:18:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 19:18:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:18:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-20 19:18:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:18:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-20 19:18:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:18:38,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-20 19:18:38,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:18:38,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161140650] [2023-12-20 19:18:38,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161140650] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:18:38,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:18:38,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-20 19:18:38,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265120540] [2023-12-20 19:18:38,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:18:38,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-20 19:18:38,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:18:38,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-20 19:18:38,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-20 19:18:38,306 INFO L87 Difference]: Start difference. First operand 207 states and 307 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 19:18:42,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:18:47,901 WARN L293 SmtUtils]: Spent 5.64s on a formula simplification that was a NOOP. DAG size: 191 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 19:18:49,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:18:49,070 INFO L93 Difference]: Finished difference Result 378 states and 565 transitions. [2023-12-20 19:18:49,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-20 19:18:49,071 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 160 [2023-12-20 19:18:49,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:18:49,073 INFO L225 Difference]: With dead ends: 378 [2023-12-20 19:18:49,073 INFO L226 Difference]: Without dead ends: 308 [2023-12-20 19:18:49,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2023-12-20 19:18:49,077 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 179 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-12-20 19:18:49,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 508 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-12-20 19:18:49,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2023-12-20 19:18:49,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 275. [2023-12-20 19:18:49,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 167 states have (on average 1.2634730538922156) internal successors, (211), 168 states have internal predecessors, (211), 100 states have call successors, (100), 7 states have call predecessors, (100), 7 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2023-12-20 19:18:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 411 transitions. [2023-12-20 19:18:49,111 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 411 transitions. Word has length 160 [2023-12-20 19:18:49,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:18:49,112 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 411 transitions. [2023-12-20 19:18:49,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 19:18:49,112 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 411 transitions. [2023-12-20 19:18:49,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-12-20 19:18:49,114 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:18:49,114 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 19:18:49,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 19:18:49,114 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:18:49,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:18:49,115 INFO L85 PathProgramCache]: Analyzing trace with hash -359036203, now seen corresponding path program 1 times [2023-12-20 19:18:49,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:18:49,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471365840] [2023-12-20 19:18:49,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:18:49,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:18:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:38,966 WARN L293 SmtUtils]: Spent 6.19s on a formula simplification. DAG size of input: 176 DAG size of output: 159 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 19:19:38,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:19:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:38,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:19:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:38,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:19:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:38,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:19:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:38,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:19:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:38,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:19:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:38,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:19:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:38,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:19:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:38,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:19:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:38,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:19:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:38,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:19:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:39,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:19:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:39,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:19:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:39,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:19:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:39,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:19:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:39,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:19:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:39,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:19:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:39,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:19:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:39,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:19:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:39,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 19:19:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:39,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 19:19:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:39,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:19:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:39,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-20 19:19:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:39,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:19:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:39,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-20 19:19:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:19:39,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-20 19:19:39,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:19:39,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471365840] [2023-12-20 19:19:39,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471365840] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:19:39,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:19:39,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-20 19:19:39,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196413536] [2023-12-20 19:19:39,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:19:39,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-20 19:19:39,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:19:39,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-20 19:19:39,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-12-20 19:19:39,145 INFO L87 Difference]: Start difference. First operand 275 states and 411 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-20 19:19:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:19:43,148 INFO L93 Difference]: Finished difference Result 630 states and 921 transitions. [2023-12-20 19:19:43,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-20 19:19:43,148 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 160 [2023-12-20 19:19:43,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:19:43,152 INFO L225 Difference]: With dead ends: 630 [2023-12-20 19:19:43,152 INFO L226 Difference]: Without dead ends: 480 [2023-12-20 19:19:43,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=273, Invalid=657, Unknown=0, NotChecked=0, Total=930 [2023-12-20 19:19:43,154 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 282 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-20 19:19:43,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 717 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-20 19:19:43,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2023-12-20 19:19:43,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 369. [2023-12-20 19:19:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 232 states have (on average 1.2629310344827587) internal successors, (293), 232 states have internal predecessors, (293), 125 states have call successors, (125), 11 states have call predecessors, (125), 11 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2023-12-20 19:19:43,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 543 transitions. [2023-12-20 19:19:43,206 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 543 transitions. Word has length 160 [2023-12-20 19:19:43,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:19:43,206 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 543 transitions. [2023-12-20 19:19:43,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-20 19:19:43,207 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 543 transitions. [2023-12-20 19:19:43,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-12-20 19:19:43,208 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:19:43,208 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 19:19:43,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 19:19:43,209 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:19:43,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:19:43,209 INFO L85 PathProgramCache]: Analyzing trace with hash 342028375, now seen corresponding path program 1 times [2023-12-20 19:19:43,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:19:43,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897948638] [2023-12-20 19:19:43,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:19:43,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:19:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:20:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:20:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:20:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:20:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:20:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:20:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:20:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:20:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:20:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:20:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:20:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:20:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:20:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:20:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:20:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:20:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:20:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:20:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:20:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 19:20:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 19:20:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:20:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-20 19:20:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:20:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-20 19:20:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:20:33,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-20 19:20:33,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:20:33,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897948638] [2023-12-20 19:20:33,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897948638] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:20:33,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:20:33,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-20 19:20:33,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432897021] [2023-12-20 19:20:33,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:20:33,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-20 19:20:33,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:20:33,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-20 19:20:33,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-20 19:20:33,424 INFO L87 Difference]: Start difference. First operand 369 states and 543 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 19:20:38,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:20:42,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:20:43,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:20:43,635 INFO L93 Difference]: Finished difference Result 742 states and 1077 transitions. [2023-12-20 19:20:43,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-20 19:20:43,636 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 160 [2023-12-20 19:20:43,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:20:43,638 INFO L225 Difference]: With dead ends: 742 [2023-12-20 19:20:43,639 INFO L226 Difference]: Without dead ends: 508 [2023-12-20 19:20:43,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=221, Invalid=535, Unknown=0, NotChecked=0, Total=756 [2023-12-20 19:20:43,640 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 213 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 84 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2023-12-20 19:20:43,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 749 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 645 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2023-12-20 19:20:43,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2023-12-20 19:20:43,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 363. [2023-12-20 19:20:43,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 226 states have (on average 1.261061946902655) internal successors, (285), 226 states have internal predecessors, (285), 125 states have call successors, (125), 11 states have call predecessors, (125), 11 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2023-12-20 19:20:43,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 535 transitions. [2023-12-20 19:20:43,692 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 535 transitions. Word has length 160 [2023-12-20 19:20:43,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:20:43,692 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 535 transitions. [2023-12-20 19:20:43,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 19:20:43,693 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 535 transitions. [2023-12-20 19:20:43,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-20 19:20:43,694 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:20:43,694 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 19:20:43,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 19:20:43,694 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:20:43,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:20:43,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1070899807, now seen corresponding path program 1 times [2023-12-20 19:20:43,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:20:43,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713856557] [2023-12-20 19:20:43,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:20:43,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:20:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:21:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:21:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:21:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:21:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:21:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:21:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:21:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:21:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:21:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:21:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:21:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:21:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:21:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:21:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:21:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:21:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:21:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:21:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:21:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 19:21:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 19:21:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:21:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-20 19:21:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:21:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-20 19:21:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:21:33,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-20 19:21:33,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:21:33,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713856557] [2023-12-20 19:21:33,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713856557] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:21:33,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:21:33,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-20 19:21:33,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239331747] [2023-12-20 19:21:33,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:21:33,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-20 19:21:33,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:21:33,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-20 19:21:33,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-20 19:21:33,686 INFO L87 Difference]: Start difference. First operand 363 states and 535 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 19:21:40,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:21:40,086 INFO L93 Difference]: Finished difference Result 691 states and 1010 transitions. [2023-12-20 19:21:40,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-20 19:21:40,086 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 161 [2023-12-20 19:21:40,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:21:40,089 INFO L225 Difference]: With dead ends: 691 [2023-12-20 19:21:40,089 INFO L226 Difference]: Without dead ends: 463 [2023-12-20 19:21:40,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2023-12-20 19:21:40,091 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 305 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-20 19:21:40,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 578 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-20 19:21:40,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2023-12-20 19:21:40,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 374. [2023-12-20 19:21:40,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 237 states have (on average 1.2658227848101267) internal successors, (300), 237 states have internal predecessors, (300), 125 states have call successors, (125), 11 states have call predecessors, (125), 11 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2023-12-20 19:21:40,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 550 transitions. [2023-12-20 19:21:40,132 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 550 transitions. Word has length 161 [2023-12-20 19:21:40,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:21:40,134 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 550 transitions. [2023-12-20 19:21:40,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 19:21:40,135 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 550 transitions. [2023-12-20 19:21:40,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-20 19:21:40,136 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:21:40,136 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 19:21:40,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-20 19:21:40,136 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:21:40,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:21:40,137 INFO L85 PathProgramCache]: Analyzing trace with hash 729889823, now seen corresponding path program 1 times [2023-12-20 19:21:40,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:21:40,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725212972] [2023-12-20 19:21:40,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:21:40,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:21:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:22:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:22:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:22:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:22:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:22:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:22:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:22:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:22:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:22:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:22:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:22:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:22:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:22:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:22:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:22:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:22:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:22:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:22:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:22:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 19:22:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 19:22:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:22:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-20 19:22:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:22:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-20 19:22:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-20 19:22:37,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:22:37,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725212972] [2023-12-20 19:22:37,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725212972] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:22:37,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:22:37,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-20 19:22:37,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204574228] [2023-12-20 19:22:37,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:22:37,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-20 19:22:37,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:22:37,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-20 19:22:37,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-12-20 19:22:37,633 INFO L87 Difference]: Start difference. First operand 374 states and 550 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-20 19:22:47,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:22:48,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:22:48,835 INFO L93 Difference]: Finished difference Result 719 states and 1043 transitions. [2023-12-20 19:22:48,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-20 19:22:48,836 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 161 [2023-12-20 19:22:48,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:22:48,840 INFO L225 Difference]: With dead ends: 719 [2023-12-20 19:22:48,841 INFO L226 Difference]: Without dead ends: 480 [2023-12-20 19:22:48,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=220, Invalid=482, Unknown=0, NotChecked=0, Total=702 [2023-12-20 19:22:48,844 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 301 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 109 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-12-20 19:22:48,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 647 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 669 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2023-12-20 19:22:48,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2023-12-20 19:22:48,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 381. [2023-12-20 19:22:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 244 states have (on average 1.2663934426229508) internal successors, (309), 244 states have internal predecessors, (309), 125 states have call successors, (125), 11 states have call predecessors, (125), 11 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2023-12-20 19:22:48,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 559 transitions. [2023-12-20 19:22:48,888 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 559 transitions. Word has length 161 [2023-12-20 19:22:48,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:22:48,889 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 559 transitions. [2023-12-20 19:22:48,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-20 19:22:48,889 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 559 transitions. [2023-12-20 19:22:48,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-20 19:22:48,892 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:22:48,892 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 19:22:48,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-20 19:22:48,892 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:22:48,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:22:48,892 INFO L85 PathProgramCache]: Analyzing trace with hash 988055261, now seen corresponding path program 1 times [2023-12-20 19:22:48,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:22:48,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444792972] [2023-12-20 19:22:48,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:22:48,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:22:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:22:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:22:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:22:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:22:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:22:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:22:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:22:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:22:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:22:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:22:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:22:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:22:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:22:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:22:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:22:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:22:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:22:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:22:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:22:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 19:22:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 19:22:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:22:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-20 19:22:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:22:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-20 19:22:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:22:49,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-20 19:22:49,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:22:49,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444792972] [2023-12-20 19:22:49,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444792972] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:22:49,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:22:49,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 19:22:49,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168179363] [2023-12-20 19:22:49,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:22:49,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 19:22:49,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:22:49,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 19:22:49,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 19:22:49,150 INFO L87 Difference]: Start difference. First operand 381 states and 559 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 19:22:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:22:49,368 INFO L93 Difference]: Finished difference Result 792 states and 1138 transitions. [2023-12-20 19:22:49,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 19:22:49,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 161 [2023-12-20 19:22:49,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:22:49,371 INFO L225 Difference]: With dead ends: 792 [2023-12-20 19:22:49,371 INFO L226 Difference]: Without dead ends: 546 [2023-12-20 19:22:49,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 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-20 19:22:49,373 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 65 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 19:22:49,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 414 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 19:22:49,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2023-12-20 19:22:49,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 531. [2023-12-20 19:22:49,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 369 states have (on average 1.2764227642276422) internal successors, (471), 374 states have internal predecessors, (471), 141 states have call successors, (141), 20 states have call predecessors, (141), 20 states have return successors, (141), 136 states have call predecessors, (141), 141 states have call successors, (141) [2023-12-20 19:22:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 753 transitions. [2023-12-20 19:22:49,426 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 753 transitions. Word has length 161 [2023-12-20 19:22:49,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:22:49,427 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 753 transitions. [2023-12-20 19:22:49,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 19:22:49,427 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 753 transitions. [2023-12-20 19:22:49,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-20 19:22:49,429 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:22:49,429 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 19:22:49,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-20 19:22:49,430 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:22:49,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:22:49,430 INFO L85 PathProgramCache]: Analyzing trace with hash -923244899, now seen corresponding path program 1 times [2023-12-20 19:22:49,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:22:49,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210861226] [2023-12-20 19:22:49,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:22:49,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:22:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:24:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:24:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:24:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:24:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:24:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:24:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:24:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:24:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:24:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:24:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:24:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:24:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:24:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:24:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:24:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:24:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:24:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:24:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:24:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 19:24:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 19:24:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:24:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-20 19:24:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:24:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-20 19:24:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:12,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-20 19:24:12,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:24:12,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210861226] [2023-12-20 19:24:12,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210861226] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:24:12,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:24:12,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-20 19:24:12,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863265083] [2023-12-20 19:24:12,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:24:12,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-20 19:24:12,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:24:12,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-20 19:24:12,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-12-20 19:24:12,159 INFO L87 Difference]: Start difference. First operand 531 states and 753 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-20 19:24:19,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:24:23,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:24:27,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:24:33,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:24:35,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:24:35,174 INFO L93 Difference]: Finished difference Result 730 states and 1027 transitions. [2023-12-20 19:24:35,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-20 19:24:35,175 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 161 [2023-12-20 19:24:35,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:24:35,178 INFO L225 Difference]: With dead ends: 730 [2023-12-20 19:24:35,178 INFO L226 Difference]: Without dead ends: 606 [2023-12-20 19:24:35,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2023-12-20 19:24:35,180 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 365 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 111 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2023-12-20 19:24:35,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 576 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 747 Invalid, 4 Unknown, 0 Unchecked, 17.5s Time] [2023-12-20 19:24:35,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2023-12-20 19:24:35,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 526. [2023-12-20 19:24:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 365 states have (on average 1.2767123287671234) internal successors, (466), 369 states have internal predecessors, (466), 139 states have call successors, (139), 21 states have call predecessors, (139), 21 states have return successors, (139), 135 states have call predecessors, (139), 139 states have call successors, (139) [2023-12-20 19:24:35,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 744 transitions. [2023-12-20 19:24:35,240 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 744 transitions. Word has length 161 [2023-12-20 19:24:35,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:24:35,240 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 744 transitions. [2023-12-20 19:24:35,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-20 19:24:35,241 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 744 transitions. [2023-12-20 19:24:35,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-20 19:24:35,242 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:24:35,242 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 19:24:35,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-20 19:24:35,242 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:24:35,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:24:35,243 INFO L85 PathProgramCache]: Analyzing trace with hash -865986597, now seen corresponding path program 1 times [2023-12-20 19:24:35,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:24:35,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901068890] [2023-12-20 19:24:35,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:24:35,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:24:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:25:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:25:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:25:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:25:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:25:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:25:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:25:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:25:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:25:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:25:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:25:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:25:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:25:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:25:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:25:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:25:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:25:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:25:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:25:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 19:25:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 19:25:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:25:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-20 19:25:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:25:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-20 19:25:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:06,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-20 19:25:06,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:25:06,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901068890] [2023-12-20 19:25:06,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901068890] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:25:06,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:25:06,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-20 19:25:06,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125134039] [2023-12-20 19:25:06,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:25:06,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-20 19:25:06,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:25:06,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-20 19:25:06,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-12-20 19:25:06,775 INFO L87 Difference]: Start difference. First operand 526 states and 744 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-20 19:25:12,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:25:17,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:25:21,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:25:23,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:25:23,391 INFO L93 Difference]: Finished difference Result 879 states and 1224 transitions. [2023-12-20 19:25:23,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-20 19:25:23,392 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 161 [2023-12-20 19:25:23,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:25:23,395 INFO L225 Difference]: With dead ends: 879 [2023-12-20 19:25:23,395 INFO L226 Difference]: Without dead ends: 755 [2023-12-20 19:25:23,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=284, Invalid=976, Unknown=0, NotChecked=0, Total=1260 [2023-12-20 19:25:23,397 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 355 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 147 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2023-12-20 19:25:23,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 700 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 664 Invalid, 3 Unknown, 0 Unchecked, 13.3s Time] [2023-12-20 19:25:23,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2023-12-20 19:25:23,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 554. [2023-12-20 19:25:23,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 392 states have (on average 1.2933673469387754) internal successors, (507), 396 states have internal predecessors, (507), 139 states have call successors, (139), 22 states have call predecessors, (139), 22 states have return successors, (139), 135 states have call predecessors, (139), 139 states have call successors, (139) [2023-12-20 19:25:23,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 785 transitions. [2023-12-20 19:25:23,460 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 785 transitions. Word has length 161 [2023-12-20 19:25:23,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:25:23,461 INFO L495 AbstractCegarLoop]: Abstraction has 554 states and 785 transitions. [2023-12-20 19:25:23,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-20 19:25:23,461 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 785 transitions. [2023-12-20 19:25:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-20 19:25:23,463 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:25:23,463 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 19:25:23,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-20 19:25:23,463 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:25:23,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:25:23,463 INFO L85 PathProgramCache]: Analyzing trace with hash -665079461, now seen corresponding path program 1 times [2023-12-20 19:25:23,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:25:23,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892862591] [2023-12-20 19:25:23,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:25:23,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:25:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:25:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:25:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:25:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:25:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:25:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:25:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:25:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:25:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:25:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:25:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:25:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:25:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:25:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:25:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:25:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:25:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:25:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:25:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:25:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 19:25:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 19:25:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:25:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-20 19:25:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:25:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-20 19:25:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-20 19:25:23,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:25:23,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892862591] [2023-12-20 19:25:23,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892862591] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:25:23,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:25:23,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 19:25:23,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934095027] [2023-12-20 19:25:23,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:25:23,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 19:25:23,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:25:23,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 19:25:23,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 19:25:23,621 INFO L87 Difference]: Start difference. First operand 554 states and 785 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 19:25:23,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:25:23,749 INFO L93 Difference]: Finished difference Result 1006 states and 1421 transitions. [2023-12-20 19:25:23,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 19:25:23,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 161 [2023-12-20 19:25:23,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:25:23,753 INFO L225 Difference]: With dead ends: 1006 [2023-12-20 19:25:23,753 INFO L226 Difference]: Without dead ends: 641 [2023-12-20 19:25:23,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 19:25:23,754 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 31 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 19:25:23,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 339 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 19:25:23,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2023-12-20 19:25:23,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 600. [2023-12-20 19:25:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 427 states have (on average 1.2810304449648713) internal successors, (547), 433 states have internal predecessors, (547), 147 states have call successors, (147), 25 states have call predecessors, (147), 25 states have return successors, (147), 141 states have call predecessors, (147), 147 states have call successors, (147) [2023-12-20 19:25:23,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 841 transitions. [2023-12-20 19:25:23,819 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 841 transitions. Word has length 161 [2023-12-20 19:25:23,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:25:23,819 INFO L495 AbstractCegarLoop]: Abstraction has 600 states and 841 transitions. [2023-12-20 19:25:23,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 19:25:23,819 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 841 transitions. [2023-12-20 19:25:23,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-20 19:25:23,820 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:25:23,820 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 19:25:23,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-20 19:25:23,820 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:25:23,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:25:23,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1264254883, now seen corresponding path program 1 times [2023-12-20 19:25:23,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:25:23,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909465292] [2023-12-20 19:25:23,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:25:23,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:25:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:25:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:25:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:25:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:25:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:25:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:25:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:25:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:25:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:25:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:25:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:25:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:25:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:25:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:25:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:25:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:25:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:25:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:25:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:25:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 19:25:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 19:25:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:25:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-20 19:25:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:25:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-20 19:25:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:25:45,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-20 19:25:45,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:25:45,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909465292] [2023-12-20 19:25:45,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909465292] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:25:45,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:25:45,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-20 19:25:45,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973323555] [2023-12-20 19:25:45,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:25:45,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-20 19:25:45,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:25:45,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-20 19:25:45,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2023-12-20 19:25:45,497 INFO L87 Difference]: Start difference. First operand 600 states and 841 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-20 19:25:51,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:25:52,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:25:52,298 INFO L93 Difference]: Finished difference Result 1076 states and 1502 transitions. [2023-12-20 19:25:52,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-20 19:25:52,299 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 161 [2023-12-20 19:25:52,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:25:52,302 INFO L225 Difference]: With dead ends: 1076 [2023-12-20 19:25:52,302 INFO L226 Difference]: Without dead ends: 665 [2023-12-20 19:25:52,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=245, Invalid=511, Unknown=0, NotChecked=0, Total=756 [2023-12-20 19:25:52,304 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 288 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 97 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-12-20 19:25:52,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 672 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 656 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2023-12-20 19:25:52,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2023-12-20 19:25:52,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 602. [2023-12-20 19:25:52,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 429 states have (on average 1.2797202797202798) internal successors, (549), 435 states have internal predecessors, (549), 147 states have call successors, (147), 25 states have call predecessors, (147), 25 states have return successors, (147), 141 states have call predecessors, (147), 147 states have call successors, (147) [2023-12-20 19:25:52,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 843 transitions. [2023-12-20 19:25:52,374 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 843 transitions. Word has length 161 [2023-12-20 19:25:52,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:25:52,374 INFO L495 AbstractCegarLoop]: Abstraction has 602 states and 843 transitions. [2023-12-20 19:25:52,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-20 19:25:52,375 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 843 transitions. [2023-12-20 19:25:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-20 19:25:52,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:25:52,376 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 19:25:52,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-20 19:25:52,376 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:25:52,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:25:52,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1206996581, now seen corresponding path program 1 times [2023-12-20 19:25:52,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:25:52,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558363159] [2023-12-20 19:25:52,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:25:52,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:25:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:26:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:26:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:26:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:26:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:26:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:26:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:26:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:26:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:26:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:26:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:26:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:26:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:26:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:26:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:26:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:26:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:26:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:26:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:26:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 19:26:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 19:26:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:26:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-20 19:26:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:26:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-20 19:26:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-20 19:26:11,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:26:11,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558363159] [2023-12-20 19:26:11,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558363159] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:26:11,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:26:11,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-20 19:26:11,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887839852] [2023-12-20 19:26:11,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:26:11,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-20 19:26:11,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:26:11,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-20 19:26:11,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-12-20 19:26:11,741 INFO L87 Difference]: Start difference. First operand 602 states and 843 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-20 19:26:13,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:26:13,406 INFO L93 Difference]: Finished difference Result 1105 states and 1530 transitions. [2023-12-20 19:26:13,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-20 19:26:13,412 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 161 [2023-12-20 19:26:13,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:26:13,416 INFO L225 Difference]: With dead ends: 1105 [2023-12-20 19:26:13,416 INFO L226 Difference]: Without dead ends: 692 [2023-12-20 19:26:13,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=240, Invalid=516, Unknown=0, NotChecked=0, Total=756 [2023-12-20 19:26:13,419 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 240 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-20 19:26:13,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 670 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-20 19:26:13,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2023-12-20 19:26:13,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 549. [2023-12-20 19:26:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 391 states have (on average 1.2864450127877238) internal successors, (503), 394 states have internal predecessors, (503), 135 states have call successors, (135), 22 states have call predecessors, (135), 22 states have return successors, (135), 132 states have call predecessors, (135), 135 states have call successors, (135) [2023-12-20 19:26:13,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 773 transitions. [2023-12-20 19:26:13,484 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 773 transitions. Word has length 161 [2023-12-20 19:26:13,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:26:13,484 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 773 transitions. [2023-12-20 19:26:13,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-20 19:26:13,484 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 773 transitions. [2023-12-20 19:26:13,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-20 19:26:13,485 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:26:13,485 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 19:26:13,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-20 19:26:13,486 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:26:13,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:26:13,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1891095640, now seen corresponding path program 1 times [2023-12-20 19:26:13,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:26:13,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609402813] [2023-12-20 19:26:13,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:26:13,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:26:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:26:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:26:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:26:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:26:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:26:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:26:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:26:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:26:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:26:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:26:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:26:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:26:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:26:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:26:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:26:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:26:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:26:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:26:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:26:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 19:26:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 19:26:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:26:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-20 19:26:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:26:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-20 19:26:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:15,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-20 19:26:15,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:26:15,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609402813] [2023-12-20 19:26:15,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609402813] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:26:15,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:26:15,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-20 19:26:15,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542825490] [2023-12-20 19:26:15,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:26:15,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-20 19:26:15,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:26:15,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-20 19:26:15,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-12-20 19:26:15,628 INFO L87 Difference]: Start difference. First operand 549 states and 773 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 19:26:16,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:26:16,664 INFO L93 Difference]: Finished difference Result 1061 states and 1495 transitions. [2023-12-20 19:26:16,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-20 19:26:16,664 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 162 [2023-12-20 19:26:16,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:26:16,668 INFO L225 Difference]: With dead ends: 1061 [2023-12-20 19:26:16,668 INFO L226 Difference]: Without dead ends: 904 [2023-12-20 19:26:16,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2023-12-20 19:26:16,670 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 209 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-20 19:26:16,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 653 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-20 19:26:16,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2023-12-20 19:26:16,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 712. [2023-12-20 19:26:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 528 states have (on average 1.316287878787879) internal successors, (695), 535 states have internal predecessors, (695), 157 states have call successors, (157), 26 states have call predecessors, (157), 26 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2023-12-20 19:26:16,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1009 transitions. [2023-12-20 19:26:16,752 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1009 transitions. Word has length 162 [2023-12-20 19:26:16,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:26:16,752 INFO L495 AbstractCegarLoop]: Abstraction has 712 states and 1009 transitions. [2023-12-20 19:26:16,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 19:26:16,753 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1009 transitions. [2023-12-20 19:26:16,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-20 19:26:16,754 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:26:16,754 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 19:26:16,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-20 19:26:16,754 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:26:16,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:26:16,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1892942682, now seen corresponding path program 1 times [2023-12-20 19:26:16,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:26:16,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29750124] [2023-12-20 19:26:16,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:26:16,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:26:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:26:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:26:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:26:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:26:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:26:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:26:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:26:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:26:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:26:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:26:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:26:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:26:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:26:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:26:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:26:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:26:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:26:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:26:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:26:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 19:26:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 19:26:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:26:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-20 19:26:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:26:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-20 19:26:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:17,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 102 proven. 96 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2023-12-20 19:26:17,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:26:17,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29750124] [2023-12-20 19:26:17,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29750124] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 19:26:17,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6316488] [2023-12-20 19:26:17,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:26:17,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 19:26:17,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 19:26:17,924 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 19:26:17,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 19:26:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:18,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-20 19:26:18,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 19:26:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 774 proven. 96 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2023-12-20 19:26:19,104 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 19:26:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 102 proven. 105 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2023-12-20 19:26:20,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6316488] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 19:26:20,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 19:26:20,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 45 [2023-12-20 19:26:20,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714332758] [2023-12-20 19:26:20,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 19:26:20,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-20 19:26:20,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:26:20,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-20 19:26:20,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1732, Unknown=0, NotChecked=0, Total=1980 [2023-12-20 19:26:20,299 INFO L87 Difference]: Start difference. First operand 712 states and 1009 transitions. Second operand has 45 states, 43 states have (on average 2.7674418604651163) internal successors, (119), 42 states have internal predecessors, (119), 11 states have call successors, (64), 4 states have call predecessors, (64), 9 states have return successors, (65), 11 states have call predecessors, (65), 11 states have call successors, (65) [2023-12-20 19:26:26,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:26:26,981 INFO L93 Difference]: Finished difference Result 1912 states and 2544 transitions. [2023-12-20 19:26:26,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2023-12-20 19:26:26,982 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 2.7674418604651163) internal successors, (119), 42 states have internal predecessors, (119), 11 states have call successors, (64), 4 states have call predecessors, (64), 9 states have return successors, (65), 11 states have call predecessors, (65), 11 states have call successors, (65) Word has length 162 [2023-12-20 19:26:26,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:26:26,987 INFO L225 Difference]: With dead ends: 1912 [2023-12-20 19:26:26,987 INFO L226 Difference]: Without dead ends: 1370 [2023-12-20 19:26:26,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4467 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2568, Invalid=12438, Unknown=0, NotChecked=0, Total=15006 [2023-12-20 19:26:26,993 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 1541 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 2184 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 2580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 2184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-20 19:26:26,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1554 Valid, 1278 Invalid, 2580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 2184 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-20 19:26:26,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2023-12-20 19:26:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 796. [2023-12-20 19:26:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 591 states have (on average 1.2656514382402708) internal successors, (748), 598 states have internal predecessors, (748), 159 states have call successors, (159), 45 states have call predecessors, (159), 45 states have return successors, (159), 152 states have call predecessors, (159), 159 states have call successors, (159) [2023-12-20 19:26:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1066 transitions. [2023-12-20 19:26:27,132 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1066 transitions. Word has length 162 [2023-12-20 19:26:27,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:26:27,133 INFO L495 AbstractCegarLoop]: Abstraction has 796 states and 1066 transitions. [2023-12-20 19:26:27,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 2.7674418604651163) internal successors, (119), 42 states have internal predecessors, (119), 11 states have call successors, (64), 4 states have call predecessors, (64), 9 states have return successors, (65), 11 states have call predecessors, (65), 11 states have call successors, (65) [2023-12-20 19:26:27,133 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1066 transitions. [2023-12-20 19:26:27,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-20 19:26:27,134 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:26:27,134 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 19:26:27,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-20 19:26:27,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-20 19:26:27,344 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:26:27,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:26:27,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1171721384, now seen corresponding path program 1 times [2023-12-20 19:26:27,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:26:27,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100849674] [2023-12-20 19:26:27,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:26:27,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:26:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:26:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:26:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:26:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:26:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:26:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:26:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:26:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:26:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:26:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:26:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:26:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:26:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:26:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:26:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:26:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:26:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:26:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:26:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:26:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 19:26:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 19:26:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:26:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-20 19:26:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:26:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-20 19:26:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:26:28,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-20 19:26:28,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:26:28,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100849674] [2023-12-20 19:26:28,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100849674] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:26:28,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:26:28,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-20 19:26:28,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438001411] [2023-12-20 19:26:28,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:26:28,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-20 19:26:28,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:26:28,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-20 19:26:28,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-20 19:26:28,897 INFO L87 Difference]: Start difference. First operand 796 states and 1066 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 19:26:29,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:26:29,820 INFO L93 Difference]: Finished difference Result 1278 states and 1688 transitions. [2023-12-20 19:26:29,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-20 19:26:29,820 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 162 [2023-12-20 19:26:29,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:26:29,824 INFO L225 Difference]: With dead ends: 1278 [2023-12-20 19:26:29,824 INFO L226 Difference]: Without dead ends: 1276 [2023-12-20 19:26:29,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2023-12-20 19:26:29,825 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 131 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-20 19:26:29,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 928 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-20 19:26:29,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2023-12-20 19:26:29,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 888. [2023-12-20 19:26:29,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 665 states have (on average 1.2721804511278196) internal successors, (846), 674 states have internal predecessors, (846), 173 states have call successors, (173), 49 states have call predecessors, (173), 49 states have return successors, (173), 164 states have call predecessors, (173), 173 states have call successors, (173) [2023-12-20 19:26:29,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1192 transitions. [2023-12-20 19:26:29,958 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1192 transitions. Word has length 162 [2023-12-20 19:26:29,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:26:29,959 INFO L495 AbstractCegarLoop]: Abstraction has 888 states and 1192 transitions. [2023-12-20 19:26:29,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 19:26:29,959 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1192 transitions. [2023-12-20 19:26:29,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-20 19:26:29,960 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:26:29,960 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 19:26:29,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-20 19:26:29,960 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:26:29,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:26:29,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1169874342, now seen corresponding path program 1 times [2023-12-20 19:26:29,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:26:29,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083329931] [2023-12-20 19:26:29,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:26:29,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:26:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 19:26:30,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 19:26:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 19:26:30,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 19:26:30,172 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 19:26:30,173 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 19:26:30,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-20 19:26:30,178 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] [2023-12-20 19:26:30,181 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 19:26:30,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 07:26:30 BoogieIcfgContainer [2023-12-20 19:26:30,297 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 19:26:30,298 INFO L158 Benchmark]: Toolchain (without parser) took 699476.14ms. Allocated memory was 198.2MB in the beginning and 933.2MB in the end (delta: 735.1MB). Free memory was 153.8MB in the beginning and 564.7MB in the end (delta: -410.9MB). Peak memory consumption was 325.2MB. Max. memory is 8.0GB. [2023-12-20 19:26:30,298 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 198.2MB. Free memory is still 156.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 19:26:30,298 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.88ms. Allocated memory is still 198.2MB. Free memory was 153.4MB in the beginning and 138.4MB in the end (delta: 15.0MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-20 19:26:30,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.66ms. Allocated memory is still 198.2MB. Free memory was 138.4MB in the beginning and 133.9MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-20 19:26:30,299 INFO L158 Benchmark]: Boogie Preprocessor took 60.15ms. Allocated memory is still 198.2MB. Free memory was 133.9MB in the beginning and 126.5MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-12-20 19:26:30,302 INFO L158 Benchmark]: RCFGBuilder took 583.92ms. Allocated memory is still 198.2MB. Free memory was 126.5MB in the beginning and 156.7MB in the end (delta: -30.2MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. [2023-12-20 19:26:30,302 INFO L158 Benchmark]: TraceAbstraction took 698494.13ms. Allocated memory was 198.2MB in the beginning and 933.2MB in the end (delta: 735.1MB). Free memory was 155.7MB in the beginning and 564.7MB in the end (delta: -409.0MB). Peak memory consumption was 326.5MB. Max. memory is 8.0GB. [2023-12-20 19:26:30,306 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.14ms. Allocated memory is still 198.2MB. Free memory is still 156.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 276.88ms. Allocated memory is still 198.2MB. Free memory was 153.4MB in the beginning and 138.4MB in the end (delta: 15.0MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.66ms. Allocated memory is still 198.2MB. Free memory was 138.4MB in the beginning and 133.9MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.15ms. Allocated memory is still 198.2MB. Free memory was 133.9MB in the beginning and 126.5MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 583.92ms. Allocated memory is still 198.2MB. Free memory was 126.5MB in the beginning and 156.7MB in the end (delta: -30.2MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. * TraceAbstraction took 698494.13ms. Allocated memory was 198.2MB in the beginning and 933.2MB in the end (delta: 735.1MB). Free memory was 155.7MB in the beginning and 564.7MB in the end (delta: -409.0MB). Peak memory consumption was 326.5MB. 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 someBinaryDOUBLEComparisonOperation at line 138, overapproximation of bitwise operation at line 150. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 4; [L23] unsigned short int var_1_4 = 58792; [L24] unsigned short int var_1_5 = 8; [L25] unsigned short int var_1_6 = 64; [L26] unsigned short int var_1_7 = 16; [L27] unsigned char var_1_8 = 0; [L28] unsigned char var_1_9 = 1; [L29] signed short int var_1_10 = 1000; [L30] signed short int var_1_11 = 1; [L31] signed short int var_1_12 = -25; [L32] signed short int var_1_13 = 25; [L33] unsigned short int var_1_14 = 5; [L34] unsigned short int var_1_16 = 20511; [L35] unsigned long int var_1_17 = 50; [L36] unsigned short int var_1_18 = 10; [L37] unsigned short int var_1_19 = 2; [L38] unsigned short int var_1_20 = 0; [L39] double var_1_21 = 9.15; [L40] double var_1_22 = 128.5; [L41] unsigned char var_1_23 = 1; [L42] double var_1_24 = 1.125; [L43] unsigned char var_1_25 = 1; [L44] unsigned char var_1_26 = 0; [L45] unsigned char var_1_27 = 1; [L46] unsigned char last_1_var_1_8 = 0; [L154] isInitial = 1 [L155] FCALL initially() [L156] COND TRUE 1 [L157] CALL updateLastVariables() [L147] last_1_var_1_8 = var_1_8 [L157] RET updateLastVariables() [L158] CALL updateVariables() [L107] var_1_4 = __VERIFIER_nondet_ushort() [L108] CALL assume_abort_if_not(var_1_4 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L108] RET assume_abort_if_not(var_1_4 >= 49150) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L109] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L109] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L110] var_1_5 = __VERIFIER_nondet_ushort() [L111] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L111] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L112] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L112] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L113] var_1_6 = __VERIFIER_nondet_ushort() [L114] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_7=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_7=16, var_1_8=0, var_1_9=1] [L114] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_7=16, var_1_8=0, var_1_9=1] [L115] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=16, var_1_8=0, var_1_9=1] [L115] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=16, var_1_8=0, var_1_9=1] [L116] var_1_7 = __VERIFIER_nondet_ushort() [L117] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_8=0, var_1_9=1] [L117] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_8=0, var_1_9=1] [L118] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L118] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L119] var_1_9 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L120] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L121] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L121] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L122] var_1_11 = __VERIFIER_nondet_short() [L123] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L123] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L124] CALL assume_abort_if_not(var_1_11 <= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L124] RET assume_abort_if_not(var_1_11 <= 8191) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L125] var_1_12 = __VERIFIER_nondet_short() [L126] CALL assume_abort_if_not(var_1_12 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L126] RET assume_abort_if_not(var_1_12 >= -16383) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L127] CALL assume_abort_if_not(var_1_12 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L127] RET assume_abort_if_not(var_1_12 <= 16383) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L128] var_1_13 = __VERIFIER_nondet_short() [L129] CALL assume_abort_if_not(var_1_13 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L129] RET assume_abort_if_not(var_1_13 >= -32767) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L130] CALL assume_abort_if_not(var_1_13 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L130] RET assume_abort_if_not(var_1_13 <= 32766) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L131] var_1_16 = __VERIFIER_nondet_ushort() [L132] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L132] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L133] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L133] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L134] var_1_20 = __VERIFIER_nondet_ushort() [L135] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L135] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L136] CALL assume_abort_if_not(var_1_20 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L136] RET assume_abort_if_not(var_1_20 <= 65534) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_22=257/2, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L137] var_1_22 = __VERIFIER_nondet_double() [L138] 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_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L138] 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_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L139] var_1_26 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L140] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_26 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not(var_1_26 <= 0) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L142] var_1_27 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_27 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L143] RET assume_abort_if_not(var_1_27 >= 1) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_27 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L144] RET assume_abort_if_not(var_1_27 <= 1) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=0, var_1_21=183/20, var_1_23=1, var_1_24=9/8, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L158] RET updateVariables() [L159] CALL step() [L50] var_1_19 = var_1_20 [L51] var_1_21 = var_1_22 [L52] var_1_23 = 0 [L53] var_1_24 = var_1_22 [L54] EXPR 64 ^ var_1_19 VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=0, var_1_1=4, var_1_20=0, var_1_21=73732, var_1_22=73732, var_1_23=0, var_1_24=73732, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L54] COND FALSE !(var_1_20 != (64 ^ var_1_19)) [L61] var_1_25 = var_1_27 VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=0, var_1_1=4, var_1_20=0, var_1_21=73732, var_1_22=73732, var_1_23=0, var_1_24=73732, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L63] unsigned short int stepLocal_1 = var_1_6; [L64] unsigned char stepLocal_0 = last_1_var_1_8; VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=0, var_1_1=4, var_1_20=0, var_1_21=73732, var_1_22=73732, var_1_23=0, var_1_24=73732, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L65] COND FALSE !(last_1_var_1_8 && stepLocal_0) VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=0, var_1_1=4, var_1_20=0, var_1_21=73732, var_1_22=73732, var_1_23=0, var_1_24=73732, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L68] COND TRUE ((((var_1_7) > (var_1_5)) ? (var_1_7) : (var_1_5))) < stepLocal_1 [L69] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=0, var_1_1=8190, var_1_20=0, var_1_21=73732, var_1_22=73732, var_1_23=0, var_1_24=73732, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L72] var_1_8 = (((var_1_7 >= var_1_5) && (var_1_4 >= var_1_1)) || var_1_9) VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=5, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=0, var_1_1=8190, var_1_20=0, var_1_21=73732, var_1_22=73732, var_1_23=0, var_1_24=73732, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L73] COND TRUE \read(var_1_8) [L74] var_1_14 = (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) - ((((var_1_5) > ((var_1_16 - var_1_11))) ? (var_1_5) : ((var_1_16 - var_1_11))))) VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=32766, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=0, var_1_1=8190, var_1_20=0, var_1_21=73732, var_1_22=73732, var_1_23=0, var_1_24=73732, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L76] EXPR var_1_16 << var_1_7 VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=32766, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=0, var_1_1=8190, var_1_20=0, var_1_21=73732, var_1_22=73732, var_1_23=0, var_1_24=73732, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L76] EXPR ((var_1_13) > ((var_1_16 << var_1_7))) ? (var_1_13) : ((var_1_16 << var_1_7)) VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=32766, var_1_16=24575, var_1_17=50, var_1_18=10, var_1_19=0, var_1_1=8190, var_1_20=0, var_1_21=73732, var_1_22=73732, var_1_23=0, var_1_24=73732, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L76] signed long int stepLocal_4 = (((var_1_13) > ((var_1_16 << var_1_7))) ? (var_1_13) : ((var_1_16 << var_1_7))); [L77] COND TRUE stepLocal_4 >= var_1_14 [L78] var_1_17 = var_1_11 VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, stepLocal_4=32766, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=32766, var_1_16=24575, var_1_17=8191, var_1_18=10, var_1_19=0, var_1_1=8190, var_1_20=0, var_1_21=73732, var_1_22=73732, var_1_23=0, var_1_24=73732, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L82] unsigned short int stepLocal_5 = var_1_5; VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, stepLocal_4=32766, stepLocal_5=8190, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=32766, var_1_16=24575, var_1_17=8191, var_1_18=10, var_1_19=0, var_1_1=8190, var_1_20=0, var_1_21=73732, var_1_22=73732, var_1_23=0, var_1_24=73732, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L83] COND FALSE !(stepLocal_5 == var_1_16) VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, stepLocal_4=32766, stepLocal_5=8190, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=32766, var_1_16=24575, var_1_17=8191, var_1_18=10, var_1_19=0, var_1_1=8190, var_1_20=0, var_1_21=73732, var_1_22=73732, var_1_23=0, var_1_24=73732, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L90] COND TRUE \read(var_1_9) [L91] var_1_18 = 200 VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, stepLocal_4=32766, stepLocal_5=8190, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=32766, var_1_16=24575, var_1_17=8191, var_1_18=200, var_1_19=0, var_1_1=8190, var_1_20=0, var_1_21=73732, var_1_22=73732, var_1_23=0, var_1_24=73732, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L94] unsigned char stepLocal_3 = var_1_9; [L95] unsigned long int stepLocal_2 = var_1_17; VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, stepLocal_2=8191, stepLocal_3=1, stepLocal_4=32766, stepLocal_5=8190, var_1_10=1000, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=32766, var_1_16=24575, var_1_17=8191, var_1_18=200, var_1_19=0, var_1_1=8190, var_1_20=0, var_1_21=73732, var_1_22=73732, var_1_23=0, var_1_24=73732, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L96] COND FALSE !(stepLocal_2 < var_1_6) [L103] var_1_10 = var_1_13 VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, stepLocal_2=8191, stepLocal_3=1, stepLocal_4=32766, stepLocal_5=8190, var_1_10=32766, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=32766, var_1_16=24575, var_1_17=8191, var_1_18=200, var_1_19=0, var_1_1=8190, var_1_20=0, var_1_21=73732, var_1_22=73732, var_1_23=0, var_1_24=73732, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L159] RET step() [L160] CALL, EXPR property() [L150] EXPR (((((last_1_var_1_8 && last_1_var_1_8) ? (var_1_1 == ((unsigned short int) ((((((56892) < (var_1_4)) ? (56892) : (var_1_4))) - var_1_5) - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) : ((((((var_1_7) > (var_1_5)) ? (var_1_7) : (var_1_5))) < var_1_6) ? (var_1_1 == ((unsigned short int) var_1_5)) : 1)) && (var_1_8 == ((unsigned char) (((var_1_7 >= var_1_5) && (var_1_4 >= var_1_1)) || var_1_9)))) && ((var_1_17 < var_1_6) ? (((var_1_6 != var_1_5) || var_1_9) ? (var_1_10 == ((signed short int) (((10000 - var_1_11) - var_1_5) + ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))))) : (var_1_10 == ((signed short int) var_1_4))) : (var_1_10 == ((signed short int) var_1_13)))) && (var_1_8 ? (var_1_14 == ((unsigned short int) (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) - ((((var_1_5) > ((var_1_16 - var_1_11))) ? (var_1_5) : ((var_1_16 - var_1_11))))))) : 1)) && ((((((var_1_13) > ((var_1_16 << var_1_7))) ? (var_1_13) : ((var_1_16 << var_1_7)))) >= var_1_14) ? (var_1_17 == ((unsigned long int) var_1_11)) : (var_1_17 == ((unsigned long int) (var_1_6 + var_1_5)))) [L150] EXPR var_1_16 << var_1_7 VAL [isInitial=1, last_1_var_1_8=0, var_1_10=32766, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=32766, var_1_16=24575, var_1_17=8191, var_1_18=200, var_1_19=0, var_1_1=8190, var_1_20=0, var_1_21=73732, var_1_22=73732, var_1_23=0, var_1_24=73732, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L150] EXPR ((var_1_13) > ((var_1_16 << var_1_7))) ? (var_1_13) : ((var_1_16 << var_1_7)) [L150] EXPR var_1_16 << var_1_7 [L150] EXPR ((var_1_13) > ((var_1_16 << var_1_7))) ? (var_1_13) : ((var_1_16 << var_1_7)) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=32766, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=32766, var_1_16=24575, var_1_17=8191, var_1_18=200, var_1_19=0, var_1_1=8190, var_1_20=0, var_1_21=73732, var_1_22=73732, var_1_23=0, var_1_24=73732, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L150] EXPR (((((last_1_var_1_8 && last_1_var_1_8) ? (var_1_1 == ((unsigned short int) ((((((56892) < (var_1_4)) ? (56892) : (var_1_4))) - var_1_5) - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) : ((((((var_1_7) > (var_1_5)) ? (var_1_7) : (var_1_5))) < var_1_6) ? (var_1_1 == ((unsigned short int) var_1_5)) : 1)) && (var_1_8 == ((unsigned char) (((var_1_7 >= var_1_5) && (var_1_4 >= var_1_1)) || var_1_9)))) && ((var_1_17 < var_1_6) ? (((var_1_6 != var_1_5) || var_1_9) ? (var_1_10 == ((signed short int) (((10000 - var_1_11) - var_1_5) + ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))))) : (var_1_10 == ((signed short int) var_1_4))) : (var_1_10 == ((signed short int) var_1_13)))) && (var_1_8 ? (var_1_14 == ((unsigned short int) (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) - ((((var_1_5) > ((var_1_16 - var_1_11))) ? (var_1_5) : ((var_1_16 - var_1_11))))))) : 1)) && ((((((var_1_13) > ((var_1_16 << var_1_7))) ? (var_1_13) : ((var_1_16 << var_1_7)))) >= var_1_14) ? (var_1_17 == ((unsigned long int) var_1_11)) : (var_1_17 == ((unsigned long int) (var_1_6 + var_1_5)))) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=32766, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=32766, var_1_16=24575, var_1_17=8191, var_1_18=200, var_1_19=0, var_1_1=8190, var_1_20=0, var_1_21=73732, var_1_22=73732, var_1_23=0, var_1_24=73732, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L150-L151] return ((((((last_1_var_1_8 && last_1_var_1_8) ? (var_1_1 == ((unsigned short int) ((((((56892) < (var_1_4)) ? (56892) : (var_1_4))) - var_1_5) - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) : ((((((var_1_7) > (var_1_5)) ? (var_1_7) : (var_1_5))) < var_1_6) ? (var_1_1 == ((unsigned short int) var_1_5)) : 1)) && (var_1_8 == ((unsigned char) (((var_1_7 >= var_1_5) && (var_1_4 >= var_1_1)) || var_1_9)))) && ((var_1_17 < var_1_6) ? (((var_1_6 != var_1_5) || var_1_9) ? (var_1_10 == ((signed short int) (((10000 - var_1_11) - var_1_5) + ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))))) : (var_1_10 == ((signed short int) var_1_4))) : (var_1_10 == ((signed short int) var_1_13)))) && (var_1_8 ? (var_1_14 == ((unsigned short int) (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) - ((((var_1_5) > ((var_1_16 - var_1_11))) ? (var_1_5) : ((var_1_16 - var_1_11))))))) : 1)) && ((((((var_1_13) > ((var_1_16 << var_1_7))) ? (var_1_13) : ((var_1_16 << var_1_7)))) >= var_1_14) ? (var_1_17 == ((unsigned long int) var_1_11)) : (var_1_17 == ((unsigned long int) (var_1_6 + var_1_5))))) && ((var_1_5 == var_1_16) ? (var_1_8 ? (var_1_18 == ((unsigned short int) (((((var_1_16 + 30393) - var_1_5) < 0 ) ? -((var_1_16 + 30393) - var_1_5) : ((var_1_16 + 30393) - var_1_5))))) : (var_1_18 == ((unsigned short int) var_1_4))) : (var_1_9 ? (var_1_18 == ((unsigned short int) 200)) : 1)) ; [L160] RET, EXPR property() [L160] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_8=0, var_1_10=32766, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=32766, var_1_16=24575, var_1_17=8191, var_1_18=200, var_1_19=0, var_1_1=8190, var_1_20=0, var_1_21=73732, var_1_22=73732, var_1_23=0, var_1_24=73732, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_8=0, var_1_10=32766, var_1_11=8191, var_1_12=-6381, var_1_13=32766, var_1_14=32766, var_1_16=24575, var_1_17=8191, var_1_18=200, var_1_19=0, var_1_1=8190, var_1_20=0, var_1_21=73732, var_1_22=73732, var_1_23=0, var_1_24=73732, var_1_25=1, var_1_26=0, var_1_27=1, var_1_4=49150, var_1_5=8190, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 698.3s, OverallIterations: 19, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 111.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 5057 SdHoareTripleChecker+Valid, 67.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5044 mSDsluCounter, 11013 SdHoareTripleChecker+Invalid, 65.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8973 mSDsCounter, 1579 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10062 IncrementalHoareTripleChecker+Invalid, 11653 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1579 mSolverCounterUnsat, 2040 mSDtfsCounter, 10062 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1799 GetRequests, 1349 SyntacticMatches, 1 SemanticMatches, 449 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5871 ImplicationChecksByTransitivity, 78.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=888occurred in iteration=18, InterpolantAutomatonStates: 356, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 2291 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 583.9s InterpolantComputationTime, 3216 NumberOfCodeBlocks, 3216 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 3196 ConstructedInterpolants, 0 QuantifiedInterpolants, 41530 SizeOfPredicates, 17 NumberOfNonLiveVariables, 389 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 23703/24000 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-20 19:26:30,517 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-20 19:26:30,548 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 137 Received shutdown request...