/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_normal_file-65.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 19:34:29,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 19:34:29,945 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 19:34:29,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 19:34:29,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 19:34:29,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 19:34:29,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 19:34:29,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 19:34:29,969 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 19:34:29,969 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 19:34:29,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 19:34:29,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 19:34:29,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 19:34:29,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 19:34:29,970 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 19:34:29,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 19:34:29,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 19:34:29,971 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 19:34:29,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 19:34:29,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 19:34:29,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 19:34:29,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 19:34:29,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 19:34:29,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 19:34:29,978 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 19:34:29,978 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 19:34:29,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 19:34:29,979 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 19:34:29,979 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 19:34:29,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 19:34:29,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 19:34:29,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 19:34:29,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 19:34:29,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 19:34:29,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 19:34:29,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 19:34:29,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 19:34:29,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 19:34:29,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 19:34:29,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 19:34:29,981 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 19:34:29,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 19:34:29,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 19:34:29,981 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 19:34:30,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 19:34:30,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 19:34:30,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 19:34:30,195 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 19:34:30,195 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 19:34:30,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_normal_file-65.i [2023-12-15 19:34:31,230 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 19:34:31,397 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 19:34:31,397 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_normal_file-65.i [2023-12-15 19:34:31,405 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fe568bf2/e223c571a80b4b6480ed67398c83ef1e/FLAG6bd9bdfe6 [2023-12-15 19:34:31,414 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fe568bf2/e223c571a80b4b6480ed67398c83ef1e [2023-12-15 19:34:31,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 19:34:31,416 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 19:34:31,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 19:34:31,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 19:34:31,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 19:34:31,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 07:34:31" (1/1) ... [2023-12-15 19:34:31,421 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51a8640f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:34:31, skipping insertion in model container [2023-12-15 19:34:31,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 07:34:31" (1/1) ... [2023-12-15 19:34:31,445 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 19:34:31,532 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_codestructure_normal_file-65.i[913,926] [2023-12-15 19:34:31,576 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 19:34:31,590 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 19:34:31,599 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_codestructure_normal_file-65.i[913,926] [2023-12-15 19:34:31,621 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 19:34:31,633 INFO L206 MainTranslator]: Completed translation [2023-12-15 19:34:31,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:34:31 WrapperNode [2023-12-15 19:34:31,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 19:34:31,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 19:34:31,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 19:34:31,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 19:34:31,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:34:31" (1/1) ... [2023-12-15 19:34:31,646 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:34:31" (1/1) ... [2023-12-15 19:34:31,689 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 247 [2023-12-15 19:34:31,689 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 19:34:31,690 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 19:34:31,690 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 19:34:31,690 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 19:34:31,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:34:31" (1/1) ... [2023-12-15 19:34:31,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:34:31" (1/1) ... [2023-12-15 19:34:31,700 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:34:31" (1/1) ... [2023-12-15 19:34:31,712 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 19:34:31,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:34:31" (1/1) ... [2023-12-15 19:34:31,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:34:31" (1/1) ... [2023-12-15 19:34:31,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:34:31" (1/1) ... [2023-12-15 19:34:31,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:34:31" (1/1) ... [2023-12-15 19:34:31,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:34:31" (1/1) ... [2023-12-15 19:34:31,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:34:31" (1/1) ... [2023-12-15 19:34:31,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 19:34:31,732 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 19:34:31,732 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 19:34:31,732 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 19:34:31,733 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:34:31" (1/1) ... [2023-12-15 19:34:31,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 19:34:31,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 19:34:31,773 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 19:34:31,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 19:34:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 19:34:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 19:34:31,796 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 19:34:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 19:34:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 19:34:31,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 19:34:31,852 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 19:34:31,853 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 19:34:32,188 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 19:34:32,217 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 19:34:32,217 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 19:34:32,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 07:34:32 BoogieIcfgContainer [2023-12-15 19:34:32,218 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 19:34:32,220 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 19:34:32,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 19:34:32,223 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 19:34:32,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 07:34:31" (1/3) ... [2023-12-15 19:34:32,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7659933d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 07:34:32, skipping insertion in model container [2023-12-15 19:34:32,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:34:31" (2/3) ... [2023-12-15 19:34:32,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7659933d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 07:34:32, skipping insertion in model container [2023-12-15 19:34:32,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 07:34:32" (3/3) ... [2023-12-15 19:34:32,225 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-65.i [2023-12-15 19:34:32,236 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 19:34:32,236 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 19:34:32,267 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 19:34:32,271 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;@2ca34775, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 19:34:32,272 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 19:34:32,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-15 19:34:32,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-12-15 19:34:32,289 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:34:32,289 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 19:34:32,290 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:34:32,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:34:32,293 INFO L85 PathProgramCache]: Analyzing trace with hash -2028307046, now seen corresponding path program 1 times [2023-12-15 19:34:32,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:34:32,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264421116] [2023-12-15 19:34:32,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:34:32,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:34:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 19:34:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 19:34:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 19:34:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 19:34:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 19:34:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 19:34:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 19:34:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 19:34:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 19:34:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 19:34:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 19:34:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 19:34:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 19:34:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 19:34:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 19:34:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 19:34:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 19:34:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 19:34:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 19:34:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 19:34:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-15 19:34:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-15 19:34:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-15 19:34:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-15 19:34:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-15 19:34:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-15 19:34:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-15 19:34:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-12-15 19:34:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-15 19:34:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-12-15 19:34:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-12-15 19:34:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-12-15 19:34:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-12-15 19:34:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-12-15 19:34:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-12-15 19:34:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-15 19:34:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:32,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-12-15 19:34:32,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:34:32,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264421116] [2023-12-15 19:34:32,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264421116] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:34:32,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:34:32,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 19:34:32,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219785846] [2023-12-15 19:34:32,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:34:32,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 19:34:32,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:34:32,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 19:34:32,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 19:34:32,753 INFO L87 Difference]: Start difference. First operand has 94 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2023-12-15 19:34:32,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:34:32,812 INFO L93 Difference]: Finished difference Result 185 states and 338 transitions. [2023-12-15 19:34:32,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 19:34:32,814 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) Word has length 217 [2023-12-15 19:34:32,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:34:32,820 INFO L225 Difference]: With dead ends: 185 [2023-12-15 19:34:32,820 INFO L226 Difference]: Without dead ends: 92 [2023-12-15 19:34:32,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 19:34:32,829 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 19:34:32,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 19:34:32,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-15 19:34:32,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-12-15 19:34:32,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-15 19:34:32,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 147 transitions. [2023-12-15 19:34:32,885 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 147 transitions. Word has length 217 [2023-12-15 19:34:32,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:34:32,885 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 147 transitions. [2023-12-15 19:34:32,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2023-12-15 19:34:32,886 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 147 transitions. [2023-12-15 19:34:32,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-12-15 19:34:32,895 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:34:32,895 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 19:34:32,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 19:34:32,896 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:34:32,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:34:32,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1462861286, now seen corresponding path program 1 times [2023-12-15 19:34:32,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:34:32,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271481817] [2023-12-15 19:34:32,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:34:32,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:34:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 19:34:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 19:34:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 19:34:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 19:34:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 19:34:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 19:34:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 19:34:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 19:34:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 19:34:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 19:34:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 19:34:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 19:34:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 19:34:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 19:34:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 19:34:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 19:34:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 19:34:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 19:34:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 19:34:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 19:34:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-15 19:34:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-15 19:34:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-15 19:34:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-15 19:34:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-15 19:34:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-15 19:34:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-15 19:34:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-12-15 19:34:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-15 19:34:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-12-15 19:34:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-12-15 19:34:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-12-15 19:34:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-12-15 19:34:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-12-15 19:34:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-12-15 19:34:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-15 19:34:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:34,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-12-15 19:34:34,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:34:34,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271481817] [2023-12-15 19:34:34,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271481817] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:34:34,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:34:34,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 19:34:34,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410119152] [2023-12-15 19:34:34,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:34:34,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 19:34:34,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:34:34,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 19:34:34,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-15 19:34:34,537 INFO L87 Difference]: Start difference. First operand 92 states and 147 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-15 19:34:35,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:34:35,026 INFO L93 Difference]: Finished difference Result 238 states and 381 transitions. [2023-12-15 19:34:35,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 19:34:35,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 217 [2023-12-15 19:34:35,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:34:35,029 INFO L225 Difference]: With dead ends: 238 [2023-12-15 19:34:35,029 INFO L226 Difference]: Without dead ends: 147 [2023-12-15 19:34:35,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-15 19:34:35,030 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 93 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 19:34:35,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 445 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 19:34:35,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-12-15 19:34:35,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 111. [2023-12-15 19:34:35,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 73 states have (on average 1.5068493150684932) internal successors, (110), 73 states have internal predecessors, (110), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-15 19:34:35,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 182 transitions. [2023-12-15 19:34:35,039 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 182 transitions. Word has length 217 [2023-12-15 19:34:35,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:34:35,041 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 182 transitions. [2023-12-15 19:34:35,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-15 19:34:35,041 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 182 transitions. [2023-12-15 19:34:35,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2023-12-15 19:34:35,042 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:34:35,042 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 19:34:35,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 19:34:35,043 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:34:35,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:34:35,043 INFO L85 PathProgramCache]: Analyzing trace with hash 485711542, now seen corresponding path program 1 times [2023-12-15 19:34:35,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:34:35,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200141467] [2023-12-15 19:34:35,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:34:35,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:34:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 19:34:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 19:34:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 19:34:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 19:34:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 19:34:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 19:34:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 19:34:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 19:34:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 19:34:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 19:34:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 19:34:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 19:34:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 19:34:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 19:34:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 19:34:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 19:34:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 19:34:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 19:34:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 19:34:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 19:34:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-15 19:34:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-15 19:34:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-15 19:34:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-15 19:34:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-15 19:34:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-15 19:34:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-15 19:34:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-12-15 19:34:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-15 19:34:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-12-15 19:34:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-12-15 19:34:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-12-15 19:34:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-12-15 19:34:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-12-15 19:34:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-12-15 19:34:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-15 19:34:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:36,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-12-15 19:34:36,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:34:36,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200141467] [2023-12-15 19:34:36,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200141467] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:34:36,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:34:36,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 19:34:36,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510994679] [2023-12-15 19:34:36,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:34:36,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 19:34:36,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:34:36,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 19:34:36,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-15 19:34:36,345 INFO L87 Difference]: Start difference. First operand 111 states and 182 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-15 19:34:36,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:34:36,943 INFO L93 Difference]: Finished difference Result 392 states and 624 transitions. [2023-12-15 19:34:36,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 19:34:36,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 218 [2023-12-15 19:34:36,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:34:36,947 INFO L225 Difference]: With dead ends: 392 [2023-12-15 19:34:36,947 INFO L226 Difference]: Without dead ends: 282 [2023-12-15 19:34:36,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-15 19:34:36,948 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 200 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 19:34:36,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 562 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 19:34:36,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-12-15 19:34:36,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 256. [2023-12-15 19:34:36,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 198 states have (on average 1.5505050505050506) internal successors, (307), 201 states have internal predecessors, (307), 52 states have call successors, (52), 5 states have call predecessors, (52), 5 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-15 19:34:36,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 411 transitions. [2023-12-15 19:34:36,983 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 411 transitions. Word has length 218 [2023-12-15 19:34:36,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:34:36,984 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 411 transitions. [2023-12-15 19:34:36,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-15 19:34:36,984 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 411 transitions. [2023-12-15 19:34:36,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2023-12-15 19:34:36,986 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:34:36,986 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 19:34:36,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 19:34:36,986 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:34:36,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:34:36,986 INFO L85 PathProgramCache]: Analyzing trace with hash 743876980, now seen corresponding path program 1 times [2023-12-15 19:34:36,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:34:36,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809491427] [2023-12-15 19:34:36,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:34:36,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:34:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 19:34:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 19:34:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 19:34:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 19:34:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 19:34:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 19:34:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 19:34:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 19:34:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 19:34:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 19:34:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 19:34:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 19:34:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 19:34:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 19:34:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 19:34:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 19:34:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 19:34:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 19:34:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 19:34:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 19:34:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-15 19:34:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-15 19:34:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-15 19:34:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-15 19:34:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-15 19:34:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-15 19:34:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-15 19:34:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-12-15 19:34:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-15 19:34:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-12-15 19:34:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-12-15 19:34:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-12-15 19:34:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-12-15 19:34:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-12-15 19:34:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-12-15 19:34:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-15 19:34:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:38,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-12-15 19:34:38,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:34:38,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809491427] [2023-12-15 19:34:38,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809491427] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:34:38,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:34:38,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 19:34:38,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731256454] [2023-12-15 19:34:38,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:34:38,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 19:34:38,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:34:38,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 19:34:38,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 19:34:38,413 INFO L87 Difference]: Start difference. First operand 256 states and 411 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-15 19:34:38,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:34:38,906 INFO L93 Difference]: Finished difference Result 611 states and 967 transitions. [2023-12-15 19:34:38,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 19:34:38,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 218 [2023-12-15 19:34:38,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:34:38,910 INFO L225 Difference]: With dead ends: 611 [2023-12-15 19:34:38,910 INFO L226 Difference]: Without dead ends: 356 [2023-12-15 19:34:38,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-15 19:34:38,914 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 175 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 19:34:38,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 459 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 19:34:38,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2023-12-15 19:34:38,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 254. [2023-12-15 19:34:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 196 states have (on average 1.5255102040816326) internal successors, (299), 199 states have internal predecessors, (299), 52 states have call successors, (52), 5 states have call predecessors, (52), 5 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-15 19:34:38,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 403 transitions. [2023-12-15 19:34:38,960 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 403 transitions. Word has length 218 [2023-12-15 19:34:38,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:34:38,961 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 403 transitions. [2023-12-15 19:34:38,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-15 19:34:38,961 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 403 transitions. [2023-12-15 19:34:38,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2023-12-15 19:34:38,962 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:34:38,963 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 19:34:38,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 19:34:38,963 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:34:38,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:34:38,963 INFO L85 PathProgramCache]: Analyzing trace with hash -267240270, now seen corresponding path program 1 times [2023-12-15 19:34:38,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:34:38,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244342643] [2023-12-15 19:34:38,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:34:38,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:34:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 19:34:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 19:34:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 19:34:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 19:34:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 19:34:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 19:34:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 19:34:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 19:34:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 19:34:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 19:34:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 19:34:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 19:34:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 19:34:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 19:34:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 19:34:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 19:34:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 19:34:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 19:34:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 19:34:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 19:34:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-15 19:34:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-15 19:34:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-15 19:34:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-15 19:34:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-15 19:34:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-15 19:34:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-15 19:34:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-12-15 19:34:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-15 19:34:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-12-15 19:34:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-12-15 19:34:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-12-15 19:34:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-12-15 19:34:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-12-15 19:34:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-12-15 19:34:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-15 19:34:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-12-15 19:34:39,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:34:39,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244342643] [2023-12-15 19:34:39,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244342643] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:34:39,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:34:39,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 19:34:39,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187899950] [2023-12-15 19:34:39,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:34:39,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 19:34:39,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:34:39,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 19:34:39,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-15 19:34:39,523 INFO L87 Difference]: Start difference. First operand 254 states and 403 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-15 19:34:39,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:34:39,723 INFO L93 Difference]: Finished difference Result 509 states and 806 transitions. [2023-12-15 19:34:39,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 19:34:39,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 218 [2023-12-15 19:34:39,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:34:39,727 INFO L225 Difference]: With dead ends: 509 [2023-12-15 19:34:39,727 INFO L226 Difference]: Without dead ends: 256 [2023-12-15 19:34:39,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-15 19:34:39,728 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 89 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 19:34:39,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 348 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 19:34:39,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-12-15 19:34:39,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 227. [2023-12-15 19:34:39,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 169 states have (on average 1.5029585798816567) internal successors, (254), 172 states have internal predecessors, (254), 52 states have call successors, (52), 5 states have call predecessors, (52), 5 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-15 19:34:39,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 358 transitions. [2023-12-15 19:34:39,756 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 358 transitions. Word has length 218 [2023-12-15 19:34:39,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:34:39,756 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 358 transitions. [2023-12-15 19:34:39,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-15 19:34:39,756 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 358 transitions. [2023-12-15 19:34:39,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2023-12-15 19:34:39,758 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:34:39,758 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 19:34:39,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 19:34:39,758 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:34:39,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:34:39,759 INFO L85 PathProgramCache]: Analyzing trace with hash -535356812, now seen corresponding path program 1 times [2023-12-15 19:34:39,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:34:39,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953253074] [2023-12-15 19:34:39,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:34:39,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:34:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 19:34:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 19:34:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 19:34:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 19:34:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 19:34:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:39,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 19:34:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 19:34:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 19:34:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 19:34:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 19:34:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 19:34:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 19:34:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 19:34:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 19:34:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 19:34:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 19:34:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 19:34:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 19:34:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 19:34:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 19:34:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-15 19:34:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-15 19:34:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-15 19:34:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-15 19:34:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-15 19:34:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-15 19:34:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-15 19:34:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-12-15 19:34:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-15 19:34:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-12-15 19:34:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-12-15 19:34:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-12-15 19:34:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-12-15 19:34:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-12-15 19:34:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-12-15 19:34:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-15 19:34:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-12-15 19:34:40,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:34:40,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953253074] [2023-12-15 19:34:40,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953253074] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:34:40,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:34:40,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 19:34:40,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654751711] [2023-12-15 19:34:40,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:34:40,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 19:34:40,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:34:40,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 19:34:40,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 19:34:40,034 INFO L87 Difference]: Start difference. First operand 227 states and 358 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-15 19:34:40,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:34:40,345 INFO L93 Difference]: Finished difference Result 559 states and 864 transitions. [2023-12-15 19:34:40,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 19:34:40,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 218 [2023-12-15 19:34:40,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:34:40,352 INFO L225 Difference]: With dead ends: 559 [2023-12-15 19:34:40,352 INFO L226 Difference]: Without dead ends: 333 [2023-12-15 19:34:40,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-15 19:34:40,354 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 183 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 19:34:40,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 690 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 19:34:40,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-12-15 19:34:40,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 279. [2023-12-15 19:34:40,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 217 states have (on average 1.5207373271889402) internal successors, (330), 221 states have internal predecessors, (330), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-15 19:34:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 438 transitions. [2023-12-15 19:34:40,388 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 438 transitions. Word has length 218 [2023-12-15 19:34:40,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:34:40,389 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 438 transitions. [2023-12-15 19:34:40,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-15 19:34:40,389 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 438 transitions. [2023-12-15 19:34:40,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2023-12-15 19:34:40,390 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:34:40,390 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 19:34:40,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 19:34:40,391 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:34:40,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:34:40,391 INFO L85 PathProgramCache]: Analyzing trace with hash -277191374, now seen corresponding path program 1 times [2023-12-15 19:34:40,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:34:40,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661958086] [2023-12-15 19:34:40,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:34:40,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:34:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 19:34:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 19:34:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 19:34:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 19:34:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 19:34:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 19:34:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 19:34:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 19:34:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 19:34:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 19:34:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 19:34:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 19:34:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 19:34:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 19:34:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 19:34:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 19:34:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 19:34:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 19:34:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 19:34:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 19:34:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-15 19:34:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-15 19:34:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-15 19:34:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-15 19:34:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-15 19:34:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-15 19:34:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-15 19:34:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-12-15 19:34:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-15 19:34:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-12-15 19:34:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-12-15 19:34:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-12-15 19:34:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-12-15 19:34:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-12-15 19:34:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-12-15 19:34:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-15 19:34:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:43,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-12-15 19:34:43,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:34:43,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661958086] [2023-12-15 19:34:43,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661958086] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:34:43,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:34:43,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 19:34:43,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525468317] [2023-12-15 19:34:43,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:34:43,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 19:34:43,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:34:43,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 19:34:43,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-15 19:34:43,679 INFO L87 Difference]: Start difference. First operand 279 states and 438 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-15 19:34:44,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:34:44,320 INFO L93 Difference]: Finished difference Result 753 states and 1169 transitions. [2023-12-15 19:34:44,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 19:34:44,320 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 218 [2023-12-15 19:34:44,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:34:44,322 INFO L225 Difference]: With dead ends: 753 [2023-12-15 19:34:44,322 INFO L226 Difference]: Without dead ends: 475 [2023-12-15 19:34:44,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-15 19:34:44,323 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 146 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 19:34:44,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 517 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 19:34:44,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2023-12-15 19:34:44,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 277. [2023-12-15 19:34:44,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 215 states have (on average 1.4976744186046511) internal successors, (322), 219 states have internal predecessors, (322), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-15 19:34:44,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 430 transitions. [2023-12-15 19:34:44,355 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 430 transitions. Word has length 218 [2023-12-15 19:34:44,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:34:44,356 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 430 transitions. [2023-12-15 19:34:44,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-15 19:34:44,356 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 430 transitions. [2023-12-15 19:34:44,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2023-12-15 19:34:44,357 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:34:44,357 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 19:34:44,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 19:34:44,358 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:34:44,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:34:44,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1288308624, now seen corresponding path program 1 times [2023-12-15 19:34:44,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:34:44,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8287303] [2023-12-15 19:34:44,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:34:44,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:34:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 19:34:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 19:34:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 19:34:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 19:34:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 19:34:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 19:34:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 19:34:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 19:34:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 19:34:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 19:34:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 19:34:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 19:34:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 19:34:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 19:34:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 19:34:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 19:34:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 19:34:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 19:34:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 19:34:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 19:34:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-15 19:34:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-15 19:34:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-15 19:34:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-15 19:34:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-15 19:34:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-15 19:34:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-15 19:34:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-12-15 19:34:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-15 19:34:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-12-15 19:34:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-12-15 19:34:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-12-15 19:34:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-12-15 19:34:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-12-15 19:34:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-12-15 19:34:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-15 19:34:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:45,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-12-15 19:34:45,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:34:45,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8287303] [2023-12-15 19:34:45,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8287303] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:34:45,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:34:45,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 19:34:45,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891296072] [2023-12-15 19:34:45,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:34:45,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 19:34:45,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:34:45,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 19:34:45,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-15 19:34:45,694 INFO L87 Difference]: Start difference. First operand 277 states and 430 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-15 19:34:46,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:34:46,178 INFO L93 Difference]: Finished difference Result 744 states and 1145 transitions. [2023-12-15 19:34:46,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 19:34:46,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 218 [2023-12-15 19:34:46,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:34:46,181 INFO L225 Difference]: With dead ends: 744 [2023-12-15 19:34:46,181 INFO L226 Difference]: Without dead ends: 468 [2023-12-15 19:34:46,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-15 19:34:46,182 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 124 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 19:34:46,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 325 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 19:34:46,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2023-12-15 19:34:46,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 250. [2023-12-15 19:34:46,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 188 states have (on average 1.4734042553191489) internal successors, (277), 192 states have internal predecessors, (277), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-15 19:34:46,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 385 transitions. [2023-12-15 19:34:46,203 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 385 transitions. Word has length 218 [2023-12-15 19:34:46,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:34:46,204 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 385 transitions. [2023-12-15 19:34:46,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-15 19:34:46,204 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 385 transitions. [2023-12-15 19:34:46,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-12-15 19:34:46,205 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:34:46,206 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 19:34:46,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 19:34:46,206 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:34:46,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:34:46,206 INFO L85 PathProgramCache]: Analyzing trace with hash -628431459, now seen corresponding path program 1 times [2023-12-15 19:34:46,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:34:46,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659884640] [2023-12-15 19:34:46,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:34:46,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:34:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 19:34:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 19:34:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 19:34:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 19:34:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 19:34:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 19:34:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 19:34:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 19:34:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 19:34:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 19:34:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 19:34:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 19:34:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 19:34:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 19:34:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 19:34:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 19:34:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 19:34:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 19:34:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 19:34:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 19:34:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-15 19:34:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-15 19:34:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-15 19:34:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-15 19:34:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-15 19:34:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-15 19:34:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-15 19:34:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-12-15 19:34:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-15 19:34:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-12-15 19:34:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-12-15 19:34:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-12-15 19:34:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-12-15 19:34:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-12-15 19:34:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-12-15 19:34:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-15 19:34:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:34:46,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-12-15 19:34:46,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:34:46,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659884640] [2023-12-15 19:34:46,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659884640] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:34:46,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:34:46,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 19:34:46,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958604220] [2023-12-15 19:34:46,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:34:46,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 19:34:46,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:34:46,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 19:34:46,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 19:34:46,399 INFO L87 Difference]: Start difference. First operand 250 states and 385 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-15 19:34:46,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:34:46,650 INFO L93 Difference]: Finished difference Result 834 states and 1281 transitions. [2023-12-15 19:34:46,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 19:34:46,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 219 [2023-12-15 19:34:46,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:34:46,654 INFO L225 Difference]: With dead ends: 834 [2023-12-15 19:34:46,654 INFO L226 Difference]: Without dead ends: 585 [2023-12-15 19:34:46,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 19:34:46,657 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 168 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 19:34:46,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 398 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 19:34:46,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2023-12-15 19:34:46,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 580. [2023-12-15 19:34:46,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 440 states have (on average 1.4681818181818183) internal successors, (646), 450 states have internal predecessors, (646), 122 states have call successors, (122), 17 states have call predecessors, (122), 17 states have return successors, (122), 112 states have call predecessors, (122), 122 states have call successors, (122) [2023-12-15 19:34:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 890 transitions. [2023-12-15 19:34:46,707 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 890 transitions. Word has length 219 [2023-12-15 19:34:46,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:34:46,708 INFO L495 AbstractCegarLoop]: Abstraction has 580 states and 890 transitions. [2023-12-15 19:34:46,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-15 19:34:46,708 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 890 transitions. [2023-12-15 19:34:46,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-12-15 19:34:46,710 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:34:46,710 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 19:34:46,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 19:34:46,710 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:34:46,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:34:46,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1021458469, now seen corresponding path program 1 times [2023-12-15 19:34:46,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:34:46,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20099376] [2023-12-15 19:34:46,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:34:46,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:34:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 19:34:46,746 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 19:34:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 19:34:46,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 19:34:46,842 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 19:34:46,843 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 19:34:46,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 19:34:46,846 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 19:34:46,848 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 19:34:46,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 07:34:46 BoogieIcfgContainer [2023-12-15 19:34:46,916 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 19:34:46,917 INFO L158 Benchmark]: Toolchain (without parser) took 15500.35ms. Allocated memory was 268.4MB in the beginning and 638.6MB in the end (delta: 370.1MB). Free memory was 217.4MB in the beginning and 411.2MB in the end (delta: -193.8MB). Peak memory consumption was 177.7MB. Max. memory is 8.0GB. [2023-12-15 19:34:46,917 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 223.3MB. Free memory is still 175.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 19:34:46,917 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.53ms. Allocated memory is still 268.4MB. Free memory was 217.4MB in the beginning and 202.6MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-15 19:34:46,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.87ms. Allocated memory is still 268.4MB. Free memory was 202.6MB in the beginning and 198.3MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 19:34:46,917 INFO L158 Benchmark]: Boogie Preprocessor took 41.70ms. Allocated memory is still 268.4MB. Free memory was 198.3MB in the beginning and 193.8MB in the end (delta: 4.5MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-15 19:34:46,918 INFO L158 Benchmark]: RCFGBuilder took 485.96ms. Allocated memory is still 268.4MB. Free memory was 193.8MB in the beginning and 217.4MB in the end (delta: -23.6MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-15 19:34:46,918 INFO L158 Benchmark]: TraceAbstraction took 14696.29ms. Allocated memory was 268.4MB in the beginning and 638.6MB in the end (delta: 370.1MB). Free memory was 216.7MB in the beginning and 411.2MB in the end (delta: -194.5MB). Peak memory consumption was 175.6MB. Max. memory is 8.0GB. [2023-12-15 19:34:46,919 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.43ms. Allocated memory is still 223.3MB. Free memory is still 175.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.53ms. Allocated memory is still 268.4MB. Free memory was 217.4MB in the beginning and 202.6MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.87ms. Allocated memory is still 268.4MB. Free memory was 202.6MB in the beginning and 198.3MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.70ms. Allocated memory is still 268.4MB. Free memory was 198.3MB in the beginning and 193.8MB in the end (delta: 4.5MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 485.96ms. Allocated memory is still 268.4MB. Free memory was 193.8MB in the beginning and 217.4MB in the end (delta: -23.6MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 14696.29ms. Allocated memory was 268.4MB in the beginning and 638.6MB in the end (delta: 370.1MB). Free memory was 216.7MB in the beginning and 411.2MB in the end (delta: -194.5MB). Peak memory consumption was 175.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 149, overapproximation of someBinaryDOUBLEComparisonOperation at line 149, overapproximation of someBinaryArithmeticDOUBLEoperation at line 79. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] unsigned short int var_1_2 = 16; [L24] unsigned short int var_1_3 = 100; [L25] unsigned short int var_1_4 = 10; [L26] signed short int var_1_5 = 256; [L27] signed short int var_1_6 = -10; [L28] signed short int var_1_7 = -25; [L29] unsigned short int var_1_8 = 64; [L30] unsigned char var_1_9 = 0; [L31] unsigned char var_1_10 = 1; [L32] unsigned short int var_1_11 = 256; [L33] unsigned short int var_1_12 = 0; [L34] unsigned short int var_1_13 = 64; [L35] unsigned char var_1_14 = 1; [L36] unsigned char var_1_15 = 0; [L37] signed char var_1_16 = 50; [L38] float var_1_17 = 8.25; [L39] float var_1_18 = 1.25; [L40] signed char var_1_19 = -100; [L41] double var_1_20 = 100000000.8; [L42] double var_1_21 = 15.125; [L43] double var_1_22 = 99.22; [L44] signed long int var_1_23 = -16; [L45] unsigned char var_1_24 = 1; [L46] signed char var_1_25 = 10; [L47] signed char var_1_26 = 16; [L48] unsigned char var_1_27 = 0; [L49] double var_1_28 = 5.5; [L153] isInitial = 1 [L154] FCALL initially() [L155] COND TRUE 1 [L156] FCALL updateLastVariables() [L157] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_ushort() [L90] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L90] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L91] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L92] var_1_3 = __VERIFIER_nondet_ushort() [L93] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L93] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L94] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L95] var_1_4 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L96] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_4 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L97] RET assume_abort_if_not(var_1_4 <= 65535) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L98] var_1_5 = __VERIFIER_nondet_short() [L99] CALL assume_abort_if_not(var_1_5 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L99] RET assume_abort_if_not(var_1_5 >= -16383) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L100] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L101] var_1_6 = __VERIFIER_nondet_short() [L102] CALL assume_abort_if_not(var_1_6 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L102] RET assume_abort_if_not(var_1_6 >= -8191) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L103] CALL assume_abort_if_not(var_1_6 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L103] RET assume_abort_if_not(var_1_6 <= 8192) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L104] var_1_7 = __VERIFIER_nondet_short() [L105] CALL assume_abort_if_not(var_1_7 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L105] RET assume_abort_if_not(var_1_7 >= -8191) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L106] CALL assume_abort_if_not(var_1_7 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L106] RET assume_abort_if_not(var_1_7 <= 8191) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L107] var_1_9 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64] [L108] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64] [L109] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L109] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L110] var_1_10 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L111] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L112] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L112] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L113] var_1_11 = __VERIFIER_nondet_ushort() [L114] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L114] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L115] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L115] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L116] var_1_12 = __VERIFIER_nondet_ushort() [L117] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L117] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L118] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L118] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L119] var_1_13 = __VERIFIER_nondet_ushort() [L120] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L120] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L121] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L121] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L122] var_1_15 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L123] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L124] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L124] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L125] var_1_17 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L126] RET assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L127] var_1_18 = __VERIFIER_nondet_float() [L128] CALL assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L128] RET assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L129] var_1_19 = __VERIFIER_nondet_char() [L130] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L130] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L131] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L131] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L132] var_1_21 = __VERIFIER_nondet_double() [L133] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L133] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L134] var_1_22 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L135] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L136] var_1_25 = __VERIFIER_nondet_char() [L137] CALL assume_abort_if_not(var_1_25 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L137] RET assume_abort_if_not(var_1_25 >= -1) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L138] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L138] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L139] var_1_26 = __VERIFIER_nondet_char() [L140] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L140] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L141] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L142] var_1_27 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L143] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L144] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L157] RET updateVariables() [L158] CALL step() [L53] COND TRUE (var_1_2 <= var_1_3) || (var_1_4 > 4) [L54] var_1_1 = (((((var_1_5 + (var_1_6 + var_1_7))) > (-100)) ? ((var_1_5 + (var_1_6 + var_1_7))) : (-100))) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=5, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L58] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=5, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L63] EXPR var_1_6 ^ var_1_7 VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=5, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L63] COND FALSE !(var_1_5 > (var_1_4 + (var_1_6 ^ var_1_7))) [L66] COND FALSE !(var_1_1 < var_1_4) [L77] var_1_16 = 100 VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=5, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L79] var_1_20 = (var_1_21 - (var_1_22 + 1.5)) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L80] EXPR ((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) | var_1_6 VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L80] COND FALSE !((((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) | var_1_6) >= var_1_8) [L83] var_1_23 = ((((var_1_11) > (var_1_16)) ? (var_1_11) : (var_1_16))) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=5, var_1_23=32767, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L85] var_1_24 = ((var_1_16 <= (var_1_25 - var_1_26)) && var_1_27) [L86] var_1_28 = var_1_21 [L158] RET step() [L159] CALL, EXPR property() [L149] EXPR ((((var_1_2 <= var_1_3) || (var_1_4 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_5 + (var_1_6 + var_1_7))) > (-100)) ? ((var_1_5 + (var_1_6 + var_1_7))) : (-100))))) : (var_1_1 == ((signed short int) var_1_7))) && (var_1_9 ? (var_1_10 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_5 > (var_1_4 + (var_1_6 ^ var_1_7))) ? (var_1_14 == ((unsigned char) (var_1_9 || var_1_15))) : 1) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=5, var_1_21=100000005, var_1_23=32767, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L149] EXPR var_1_6 ^ var_1_7 VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=5, var_1_21=100000005, var_1_23=32767, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L149] EXPR ((((var_1_2 <= var_1_3) || (var_1_4 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_5 + (var_1_6 + var_1_7))) > (-100)) ? ((var_1_5 + (var_1_6 + var_1_7))) : (-100))))) : (var_1_1 == ((signed short int) var_1_7))) && (var_1_9 ? (var_1_10 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_5 > (var_1_4 + (var_1_6 ^ var_1_7))) ? (var_1_14 == ((unsigned char) (var_1_9 || var_1_15))) : 1) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=5, var_1_21=100000005, var_1_23=32767, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L149] EXPR (((((((var_1_2 <= var_1_3) || (var_1_4 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_5 + (var_1_6 + var_1_7))) > (-100)) ? ((var_1_5 + (var_1_6 + var_1_7))) : (-100))))) : (var_1_1 == ((signed short int) var_1_7))) && (var_1_9 ? (var_1_10 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_5 > (var_1_4 + (var_1_6 ^ var_1_7))) ? (var_1_14 == ((unsigned char) (var_1_9 || var_1_15))) : 1)) && ((var_1_1 < var_1_4) ? (((! (var_1_10 || var_1_9)) && var_1_14) ? ((((((2.75f) > (((((var_1_17) < (999999.95f)) ? (var_1_17) : (999999.95f))))) ? (2.75f) : (((((var_1_17) < (999999.95f)) ? (var_1_17) : (999999.95f)))))) != var_1_18) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) | var_1_6) >= var_1_8) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (var_1_16)) ? (var_1_11) : (var_1_16)))))) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=5, var_1_21=100000005, var_1_23=32767, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L149-L150] return (((((((((var_1_2 <= var_1_3) || (var_1_4 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_5 + (var_1_6 + var_1_7))) > (-100)) ? ((var_1_5 + (var_1_6 + var_1_7))) : (-100))))) : (var_1_1 == ((signed short int) var_1_7))) && (var_1_9 ? (var_1_10 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_5 > (var_1_4 + (var_1_6 ^ var_1_7))) ? (var_1_14 == ((unsigned char) (var_1_9 || var_1_15))) : 1)) && ((var_1_1 < var_1_4) ? (((! (var_1_10 || var_1_9)) && var_1_14) ? ((((((2.75f) > (((((var_1_17) < (999999.95f)) ? (var_1_17) : (999999.95f))))) ? (2.75f) : (((((var_1_17) < (999999.95f)) ? (var_1_17) : (999999.95f)))))) != var_1_18) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) | var_1_6) >= var_1_8) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (var_1_16)) ? (var_1_11) : (var_1_16))))))) && (var_1_24 == ((unsigned char) ((var_1_16 <= (var_1_25 - var_1_26)) && var_1_27)))) && (var_1_28 == ((double) var_1_21)) ; [L159] RET, EXPR property() [L159] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=5, var_1_21=100000005, var_1_23=32767, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=5, var_1_21=100000005, var_1_23=32767, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 10, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1178 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1178 mSDsluCounter, 3887 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2632 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2082 IncrementalHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 1255 mSDtfsCounter, 2082 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 765 GetRequests, 713 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=580occurred in iteration=9, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 668 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 2180 NumberOfCodeBlocks, 2180 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1952 ConstructedInterpolants, 0 QuantifiedInterpolants, 14333 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 22680/22680 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-15 19:34:46,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...