/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-51.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 21:49:54,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 21:49:54,630 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 21:49:54,633 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 21:49:54,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 21:49:54,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 21:49:54,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 21:49:54,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 21:49:54,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 21:49:54,655 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 21:49:54,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 21:49:54,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 21:49:54,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 21:49:54,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 21:49:54,657 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 21:49:54,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 21:49:54,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 21:49:54,657 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 21:49:54,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 21:49:54,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 21:49:54,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 21:49:54,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 21:49:54,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 21:49:54,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 21:49:54,659 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 21:49:54,659 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 21:49:54,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 21:49:54,660 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 21:49:54,660 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 21:49:54,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 21:49:54,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 21:49:54,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 21:49:54,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 21:49:54,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 21:49:54,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 21:49:54,662 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 21:49:54,662 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 21:49:54,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 21:49:54,662 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 21:49:54,663 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 21:49:54,663 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 21:49:54,663 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 21:49:54,663 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 21:49:54,663 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-20 21:49:54,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 21:49:54,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 21:49:54,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 21:49:54,852 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 21:49:54,853 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 21:49:54,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-51.i [2023-12-20 21:49:55,770 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 21:49:55,903 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 21:49:55,904 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-51.i [2023-12-20 21:49:55,912 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11f74a9a3/404e0b2df0ad4ef38238838d93538fe6/FLAG398cbc272 [2023-12-20 21:49:55,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11f74a9a3/404e0b2df0ad4ef38238838d93538fe6 [2023-12-20 21:49:55,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 21:49:55,926 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 21:49:55,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 21:49:55,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 21:49:55,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 21:49:55,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 09:49:55" (1/1) ... [2023-12-20 21:49:55,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d29624a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:55, skipping insertion in model container [2023-12-20 21:49:55,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 09:49:55" (1/1) ... [2023-12-20 21:49:55,969 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 21:49:56,082 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-51.i[913,926] [2023-12-20 21:49:56,120 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 21:49:56,128 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 21:49:56,137 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-51.i[913,926] [2023-12-20 21:49:56,162 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 21:49:56,174 INFO L206 MainTranslator]: Completed translation [2023-12-20 21:49:56,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:56 WrapperNode [2023-12-20 21:49:56,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 21:49:56,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 21:49:56,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 21:49:56,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 21:49:56,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:56" (1/1) ... [2023-12-20 21:49:56,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:56" (1/1) ... [2023-12-20 21:49:56,209 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2023-12-20 21:49:56,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 21:49:56,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 21:49:56,210 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 21:49:56,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 21:49:56,217 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:56" (1/1) ... [2023-12-20 21:49:56,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:56" (1/1) ... [2023-12-20 21:49:56,219 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:56" (1/1) ... [2023-12-20 21:49:56,229 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-20 21:49:56,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:56" (1/1) ... [2023-12-20 21:49:56,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:56" (1/1) ... [2023-12-20 21:49:56,234 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:56" (1/1) ... [2023-12-20 21:49:56,236 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:56" (1/1) ... [2023-12-20 21:49:56,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:56" (1/1) ... [2023-12-20 21:49:56,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:56" (1/1) ... [2023-12-20 21:49:56,240 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 21:49:56,240 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 21:49:56,240 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 21:49:56,240 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 21:49:56,241 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:56" (1/1) ... [2023-12-20 21:49:56,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 21:49:56,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 21:49:56,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-20 21:49:56,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-20 21:49:56,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 21:49:56,320 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 21:49:56,320 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 21:49:56,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 21:49:56,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 21:49:56,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 21:49:56,398 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 21:49:56,399 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 21:49:56,668 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 21:49:56,723 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 21:49:56,723 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 21:49:56,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 09:49:56 BoogieIcfgContainer [2023-12-20 21:49:56,723 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 21:49:56,745 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 21:49:56,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 21:49:56,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 21:49:56,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 09:49:55" (1/3) ... [2023-12-20 21:49:56,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22c8136f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 09:49:56, skipping insertion in model container [2023-12-20 21:49:56,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:56" (2/3) ... [2023-12-20 21:49:56,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22c8136f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 09:49:56, skipping insertion in model container [2023-12-20 21:49:56,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 09:49:56" (3/3) ... [2023-12-20 21:49:56,750 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-51.i [2023-12-20 21:49:56,761 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 21:49:56,762 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 21:49:56,806 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 21:49:56,814 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;@35c67f5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 21:49:56,814 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 21:49:56,818 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 38 states have internal predecessors, (54), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-20 21:49:56,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-20 21:49:56,833 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:49:56,833 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:49:56,834 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:49:56,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:49:56,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1138637589, now seen corresponding path program 1 times [2023-12-20 21:49:56,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:49:56,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978453300] [2023-12-20 21:49:56,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:49:56,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:49:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:49:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 21:49:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 21:49:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 21:49:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 21:49:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 21:49:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 21:49:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 21:49:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 21:49:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 21:49:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 21:49:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 21:49:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 21:49:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 21:49:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 21:49:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-20 21:49:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 21:49:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-20 21:49:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 21:49:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-20 21:49:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 21:49:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,150 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-20 21:49:57,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:49:57,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978453300] [2023-12-20 21:49:57,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978453300] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 21:49:57,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 21:49:57,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 21:49:57,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403544009] [2023-12-20 21:49:57,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 21:49:57,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 21:49:57,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:49:57,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 21:49:57,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 21:49:57,185 INFO L87 Difference]: Start difference. First operand has 61 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 38 states have internal predecessors, (54), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-20 21:49:57,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:49:57,211 INFO L93 Difference]: Finished difference Result 119 states and 211 transitions. [2023-12-20 21:49:57,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 21:49:57,213 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 131 [2023-12-20 21:49:57,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:49:57,218 INFO L225 Difference]: With dead ends: 119 [2023-12-20 21:49:57,218 INFO L226 Difference]: Without dead ends: 59 [2023-12-20 21:49:57,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 21:49:57,224 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 21:49:57,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 21:49:57,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-20 21:49:57,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-12-20 21:49:57,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-20 21:49:57,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 91 transitions. [2023-12-20 21:49:57,253 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 91 transitions. Word has length 131 [2023-12-20 21:49:57,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:49:57,254 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 91 transitions. [2023-12-20 21:49:57,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-20 21:49:57,254 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 91 transitions. [2023-12-20 21:49:57,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-20 21:49:57,257 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:49:57,257 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:49:57,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 21:49:57,258 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:49:57,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:49:57,258 INFO L85 PathProgramCache]: Analyzing trace with hash 395082289, now seen corresponding path program 1 times [2023-12-20 21:49:57,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:49:57,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875499845] [2023-12-20 21:49:57,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:49:57,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:49:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:49:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 21:49:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 21:49:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 21:49:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 21:49:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 21:49:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 21:49:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 21:49:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 21:49:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 21:49:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 21:49:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 21:49:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 21:49:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 21:49:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 21:49:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-20 21:49:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 21:49:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-20 21:49:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 21:49:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-20 21:49:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 21:49:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:57,723 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-20 21:49:57,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:49:57,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875499845] [2023-12-20 21:49:57,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875499845] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 21:49:57,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 21:49:57,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 21:49:57,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673497159] [2023-12-20 21:49:57,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 21:49:57,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 21:49:57,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:49:57,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 21:49:57,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 21:49:57,731 INFO L87 Difference]: Start difference. First operand 59 states and 91 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-20 21:49:57,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:49:57,876 INFO L93 Difference]: Finished difference Result 176 states and 272 transitions. [2023-12-20 21:49:57,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 21:49:57,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 131 [2023-12-20 21:49:57,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:49:57,879 INFO L225 Difference]: With dead ends: 176 [2023-12-20 21:49:57,879 INFO L226 Difference]: Without dead ends: 118 [2023-12-20 21:49:57,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 21:49:57,881 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 67 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 21:49:57,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 252 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 21:49:57,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-20 21:49:57,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 98. [2023-12-20 21:49:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 53 states have internal predecessors, (66), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-20 21:49:57,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 150 transitions. [2023-12-20 21:49:57,899 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 150 transitions. Word has length 131 [2023-12-20 21:49:57,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:49:57,900 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 150 transitions. [2023-12-20 21:49:57,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-20 21:49:57,900 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 150 transitions. [2023-12-20 21:49:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-20 21:49:57,901 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:49:57,901 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:49:57,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 21:49:57,902 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:49:57,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:49:57,902 INFO L85 PathProgramCache]: Analyzing trace with hash -610856372, now seen corresponding path program 1 times [2023-12-20 21:49:57,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:49:57,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467095394] [2023-12-20 21:49:57,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:49:57,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:49:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:49:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 21:49:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 21:49:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 21:49:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 21:49:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 21:49:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 21:49:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 21:49:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 21:49:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 21:49:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 21:49:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 21:49:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 21:49:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 21:49:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 21:49:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-20 21:49:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 21:49:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-20 21:49:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 21:49:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-20 21:49:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 21:49:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,265 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-20 21:49:58,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:49:58,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467095394] [2023-12-20 21:49:58,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467095394] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 21:49:58,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 21:49:58,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 21:49:58,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027580928] [2023-12-20 21:49:58,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 21:49:58,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 21:49:58,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:49:58,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 21:49:58,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 21:49:58,269 INFO L87 Difference]: Start difference. First operand 98 states and 150 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-20 21:49:58,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:49:58,437 INFO L93 Difference]: Finished difference Result 220 states and 336 transitions. [2023-12-20 21:49:58,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 21:49:58,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2023-12-20 21:49:58,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:49:58,443 INFO L225 Difference]: With dead ends: 220 [2023-12-20 21:49:58,444 INFO L226 Difference]: Without dead ends: 162 [2023-12-20 21:49:58,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-20 21:49:58,450 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 98 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 21:49:58,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 303 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 21:49:58,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-12-20 21:49:58,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 154. [2023-12-20 21:49:58,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 87 states have internal predecessors, (112), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2023-12-20 21:49:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 238 transitions. [2023-12-20 21:49:58,486 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 238 transitions. Word has length 132 [2023-12-20 21:49:58,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:49:58,488 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 238 transitions. [2023-12-20 21:49:58,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-20 21:49:58,489 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 238 transitions. [2023-12-20 21:49:58,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-20 21:49:58,494 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:49:58,495 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:49:58,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 21:49:58,495 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:49:58,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:49:58,495 INFO L85 PathProgramCache]: Analyzing trace with hash 614792216, now seen corresponding path program 1 times [2023-12-20 21:49:58,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:49:58,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483930584] [2023-12-20 21:49:58,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:49:58,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:49:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:49:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 21:49:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 21:49:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 21:49:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 21:49:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 21:49:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 21:49:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 21:49:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 21:49:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 21:49:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 21:49:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 21:49:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 21:49:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 21:49:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 21:49:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-20 21:49:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 21:49:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-20 21:49:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 21:49:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-20 21:49:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 21:49:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:58,734 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-20 21:49:58,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:49:58,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483930584] [2023-12-20 21:49:58,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483930584] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 21:49:58,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 21:49:58,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 21:49:58,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540821428] [2023-12-20 21:49:58,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 21:49:58,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 21:49:58,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:49:58,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 21:49:58,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 21:49:58,737 INFO L87 Difference]: Start difference. First operand 154 states and 238 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-20 21:49:58,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:49:58,865 INFO L93 Difference]: Finished difference Result 382 states and 594 transitions. [2023-12-20 21:49:58,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 21:49:58,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 133 [2023-12-20 21:49:58,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:49:58,870 INFO L225 Difference]: With dead ends: 382 [2023-12-20 21:49:58,870 INFO L226 Difference]: Without dead ends: 268 [2023-12-20 21:49:58,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 21:49:58,876 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 72 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 21:49:58,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 235 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 21:49:58,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-12-20 21:49:58,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2023-12-20 21:49:58,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 155 states have (on average 1.3096774193548386) internal successors, (203), 155 states have internal predecessors, (203), 105 states have call successors, (105), 5 states have call predecessors, (105), 5 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2023-12-20 21:49:58,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 413 transitions. [2023-12-20 21:49:58,927 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 413 transitions. Word has length 133 [2023-12-20 21:49:58,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:49:58,927 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 413 transitions. [2023-12-20 21:49:58,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-20 21:49:58,928 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 413 transitions. [2023-12-20 21:49:58,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-20 21:49:58,929 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:49:58,929 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:49:58,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 21:49:58,929 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:49:58,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:49:58,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1294850586, now seen corresponding path program 1 times [2023-12-20 21:49:58,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:49:58,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807272474] [2023-12-20 21:49:58,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:49:58,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:49:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:49:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 21:49:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 21:49:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 21:49:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 21:49:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 21:49:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 21:49:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 21:49:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 21:49:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 21:49:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 21:49:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 21:49:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 21:49:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 21:49:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 21:49:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-20 21:49:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 21:49:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-20 21:49:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 21:49:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-20 21:49:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 21:49:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,095 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-20 21:49:59,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:49:59,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807272474] [2023-12-20 21:49:59,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807272474] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 21:49:59,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 21:49:59,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 21:49:59,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57003667] [2023-12-20 21:49:59,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 21:49:59,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 21:49:59,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:49:59,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 21:49:59,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 21:49:59,097 INFO L87 Difference]: Start difference. First operand 266 states and 413 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-20 21:49:59,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:49:59,129 INFO L93 Difference]: Finished difference Result 492 states and 766 transitions. [2023-12-20 21:49:59,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 21:49:59,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 133 [2023-12-20 21:49:59,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:49:59,131 INFO L225 Difference]: With dead ends: 492 [2023-12-20 21:49:59,131 INFO L226 Difference]: Without dead ends: 266 [2023-12-20 21:49:59,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 21:49:59,132 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 20 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 21:49:59,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 148 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 21:49:59,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-12-20 21:49:59,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2023-12-20 21:49:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 155 states have (on average 1.2838709677419355) internal successors, (199), 155 states have internal predecessors, (199), 105 states have call successors, (105), 5 states have call predecessors, (105), 5 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2023-12-20 21:49:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 409 transitions. [2023-12-20 21:49:59,164 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 409 transitions. Word has length 133 [2023-12-20 21:49:59,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:49:59,165 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 409 transitions. [2023-12-20 21:49:59,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-20 21:49:59,165 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 409 transitions. [2023-12-20 21:49:59,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-20 21:49:59,166 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:49:59,166 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:49:59,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 21:49:59,166 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:49:59,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:49:59,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1254013257, now seen corresponding path program 1 times [2023-12-20 21:49:59,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:49:59,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207332128] [2023-12-20 21:49:59,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:49:59,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:49:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:49:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 21:49:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 21:49:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 21:49:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 21:49:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 21:49:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 21:49:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 21:49:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 21:49:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 21:49:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 21:49:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 21:49:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 21:49:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 21:49:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 21:49:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-20 21:49:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 21:49:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-20 21:49:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 21:49:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-20 21:49:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 21:49:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-12-20 21:49:59,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:49:59,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207332128] [2023-12-20 21:49:59,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207332128] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 21:49:59,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431988466] [2023-12-20 21:49:59,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:49:59,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 21:49:59,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 21:49:59,371 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 21:49:59,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 21:49:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:59,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 21:49:59,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 21:49:59,604 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 420 proven. 36 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2023-12-20 21:49:59,604 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 21:49:59,740 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-12-20 21:49:59,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431988466] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 21:49:59,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 21:49:59,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-12-20 21:49:59,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55276754] [2023-12-20 21:49:59,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 21:49:59,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 21:49:59,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:49:59,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 21:49:59,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-20 21:49:59,743 INFO L87 Difference]: Start difference. First operand 266 states and 409 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2023-12-20 21:49:59,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:49:59,873 INFO L93 Difference]: Finished difference Result 410 states and 610 transitions. [2023-12-20 21:49:59,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-20 21:49:59,874 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) Word has length 134 [2023-12-20 21:49:59,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:49:59,875 INFO L225 Difference]: With dead ends: 410 [2023-12-20 21:49:59,875 INFO L226 Difference]: Without dead ends: 296 [2023-12-20 21:49:59,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2023-12-20 21:49:59,877 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 71 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 21:49:59,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 133 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 21:49:59,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-12-20 21:49:59,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 166. [2023-12-20 21:49:59,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 96 states have (on average 1.21875) internal successors, (117), 96 states have internal predecessors, (117), 63 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2023-12-20 21:49:59,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 243 transitions. [2023-12-20 21:49:59,900 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 243 transitions. Word has length 134 [2023-12-20 21:49:59,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:49:59,900 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 243 transitions. [2023-12-20 21:49:59,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2023-12-20 21:49:59,901 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 243 transitions. [2023-12-20 21:49:59,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-20 21:49:59,902 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:49:59,902 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:49:59,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-20 21:50:00,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-20 21:50:00,108 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:50:00,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:50:00,109 INFO L85 PathProgramCache]: Analyzing trace with hash -573954887, now seen corresponding path program 1 times [2023-12-20 21:50:00,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:50:00,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822225574] [2023-12-20 21:50:00,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:50:00,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:50:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:50:00,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:50:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:50:00,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 21:50:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:50:00,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 21:50:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:50:00,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 21:50:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:50:00,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 21:50:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:50:00,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 21:50:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:50:00,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 21:50:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:50:00,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 21:50:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:50:00,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 21:50:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:50:00,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 21:50:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:50:00,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 21:50:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:50:00,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 21:50:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:50:00,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 21:50:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:50:00,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 21:50:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:50:00,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 21:50:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:50:00,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-20 21:50:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:50:00,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 21:50:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:50:00,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-20 21:50:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:50:00,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 21:50:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:50:00,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-20 21:50:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:50:00,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 21:50:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:50:00,355 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-12-20 21:50:00,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:50:00,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822225574] [2023-12-20 21:50:00,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822225574] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 21:50:00,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426418025] [2023-12-20 21:50:00,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:50:00,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 21:50:00,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 21:50:00,357 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 21:50:00,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-20 21:50:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:50:00,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-20 21:50:00,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 21:50:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 200 proven. 6 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2023-12-20 21:50:00,510 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 21:50:00,621 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-12-20 21:50:00,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426418025] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 21:50:00,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 21:50:00,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2023-12-20 21:50:00,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391827542] [2023-12-20 21:50:00,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 21:50:00,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 21:50:00,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:50:00,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 21:50:00,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-20 21:50:00,623 INFO L87 Difference]: Start difference. First operand 166 states and 243 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-20 21:50:00,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:50:00,958 INFO L93 Difference]: Finished difference Result 336 states and 475 transitions. [2023-12-20 21:50:00,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-20 21:50:00,959 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 134 [2023-12-20 21:50:00,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:50:00,960 INFO L225 Difference]: With dead ends: 336 [2023-12-20 21:50:00,961 INFO L226 Difference]: Without dead ends: 274 [2023-12-20 21:50:00,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 305 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2023-12-20 21:50:00,962 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 110 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 21:50:00,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 294 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 21:50:00,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2023-12-20 21:50:00,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 184. [2023-12-20 21:50:00,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 111 states have (on average 1.1891891891891893) internal successors, (132), 111 states have internal predecessors, (132), 63 states have call successors, (63), 9 states have call predecessors, (63), 9 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2023-12-20 21:50:00,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 258 transitions. [2023-12-20 21:50:00,997 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 258 transitions. Word has length 134 [2023-12-20 21:50:00,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:50:00,997 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 258 transitions. [2023-12-20 21:50:00,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-20 21:50:00,998 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 258 transitions. [2023-12-20 21:50:00,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-20 21:50:00,999 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:50:00,999 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:50:01,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-20 21:50:01,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-20 21:50:01,205 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:50:01,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:50:01,205 INFO L85 PathProgramCache]: Analyzing trace with hash -613111839, now seen corresponding path program 1 times [2023-12-20 21:50:01,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:50:01,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216631608] [2023-12-20 21:50:01,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:50:01,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:50:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 21:50:01,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 21:50:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 21:50:01,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 21:50:01,341 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 21:50:01,342 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 21:50:01,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-20 21:50:01,345 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:50:01,347 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 21:50:01,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 09:50:01 BoogieIcfgContainer [2023-12-20 21:50:01,415 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 21:50:01,415 INFO L158 Benchmark]: Toolchain (without parser) took 5488.72ms. Allocated memory was 197.1MB in the beginning and 323.0MB in the end (delta: 125.8MB). Free memory was 153.3MB in the beginning and 224.2MB in the end (delta: -71.0MB). Peak memory consumption was 56.1MB. Max. memory is 8.0GB. [2023-12-20 21:50:01,415 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 197.1MB. Free memory is still 152.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 21:50:01,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.76ms. Allocated memory is still 197.1MB. Free memory was 152.9MB in the beginning and 139.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-20 21:50:01,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.28ms. Allocated memory is still 197.1MB. Free memory was 138.9MB in the beginning and 136.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 21:50:01,416 INFO L158 Benchmark]: Boogie Preprocessor took 29.52ms. Allocated memory is still 197.1MB. Free memory was 136.5MB in the beginning and 133.0MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 21:50:01,416 INFO L158 Benchmark]: RCFGBuilder took 483.20ms. Allocated memory is still 197.1MB. Free memory was 133.0MB in the beginning and 112.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-20 21:50:01,416 INFO L158 Benchmark]: TraceAbstraction took 4669.40ms. Allocated memory was 197.1MB in the beginning and 323.0MB in the end (delta: 125.8MB). Free memory was 171.3MB in the beginning and 224.2MB in the end (delta: -53.0MB). Peak memory consumption was 73.4MB. Max. memory is 8.0GB. [2023-12-20 21:50:01,417 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.11ms. Allocated memory is still 197.1MB. Free memory is still 152.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 246.76ms. Allocated memory is still 197.1MB. Free memory was 152.9MB in the beginning and 139.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.28ms. Allocated memory is still 197.1MB. Free memory was 138.9MB in the beginning and 136.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.52ms. Allocated memory is still 197.1MB. Free memory was 136.5MB in the beginning and 133.0MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 483.20ms. Allocated memory is still 197.1MB. Free memory was 133.0MB in the beginning and 112.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4669.40ms. Allocated memory was 197.1MB in the beginning and 323.0MB in the end (delta: 125.8MB). Free memory was 171.3MB in the beginning and 224.2MB in the end (delta: -53.0MB). Peak memory consumption was 73.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 141, overapproximation of someUnaryDOUBLEoperation at line 37. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] double var_1_4 = 32.3; [L24] double var_1_5 = 0.25; [L25] unsigned char var_1_7 = 2; [L26] signed char var_1_8 = -10; [L27] signed char var_1_9 = 5; [L28] signed char var_1_10 = 4; [L29] signed char var_1_11 = 100; [L30] unsigned long int var_1_12 = 8; [L31] unsigned char var_1_13 = 0; [L32] unsigned long int var_1_15 = 1114432789; [L33] double var_1_17 = 256.8; [L34] double var_1_18 = 1.25; [L35] unsigned long int var_1_19 = 16; [L36] unsigned char var_1_21 = 1; [L37] double var_1_22 = -0.5; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 1; [L40] unsigned char last_1_var_1_1 = 128; [L41] unsigned long int last_1_var_1_12 = 8; [L42] double last_1_var_1_17 = 256.8; [L43] unsigned char last_1_var_1_21 = 1; [L145] isInitial = 1 [L146] FCALL initially() [L147] COND TRUE 1 [L148] CALL updateLastVariables() [L135] last_1_var_1_1 = var_1_1 [L136] last_1_var_1_12 = var_1_12 [L137] last_1_var_1_17 = var_1_17 [L138] last_1_var_1_21 = var_1_21 [L148] RET updateLastVariables() [L149] CALL updateVariables() [L100] var_1_4 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L101] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L102] var_1_5 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L103] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L104] var_1_7 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L105] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L106] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=5] [L106] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=5] [L107] var_1_9 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L108] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L109] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L109] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L110] var_1_10 = __VERIFIER_nondet_char() [L111] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L111] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L112] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L112] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L113] var_1_11 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L114] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L115] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L115] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L116] var_1_13 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L117] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L118] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L118] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L119] var_1_15 = __VERIFIER_nondet_ulong() [L120] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L120] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L121] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L121] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L122] var_1_18 = __VERIFIER_nondet_double() [L123] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L123] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L124] var_1_22 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L125] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L126] CALL assume_abort_if_not(var_1_22 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L126] RET assume_abort_if_not(var_1_22 != 0.0F) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L127] var_1_23 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L128] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L129] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L129] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L130] var_1_24 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L131] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L132] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L132] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L149] RET updateVariables() [L150] CALL step() [L47] unsigned char stepLocal_3 = ((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_3=0, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L48] COND TRUE last_1_var_1_21 || stepLocal_3 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_3=0, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L49] COND TRUE var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17))) [L50] var_1_19 = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_3=0, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L57] unsigned long int stepLocal_1 = last_1_var_1_12; [L58] unsigned long int stepLocal_0 = 32u; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=0, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L59] COND TRUE stepLocal_0 >= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=0, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L60] COND TRUE stepLocal_1 <= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=0, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L61] COND TRUE (var_1_4 - var_1_5) >= last_1_var_1_17 [L62] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=0, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L68] COND FALSE !((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=0, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L71] COND TRUE ! (var_1_17 > var_1_5) [L72] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=0, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=0, var_1_9=126] [L76] unsigned long int stepLocal_4 = var_1_19; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=0, stepLocal_4=128, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=0, var_1_9=126] [L77] COND FALSE !((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) [L88] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=0, stepLocal_4=128, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=0, var_1_9=126] [L90] unsigned char stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_2=0, stepLocal_3=0, stepLocal_4=128, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=0, var_1_9=126] [L91] COND FALSE !(var_1_21 && stepLocal_2) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_2=0, stepLocal_3=0, stepLocal_4=128, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=0, var_1_9=126] [L94] COND FALSE !(\read(var_1_21)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_2=0, stepLocal_3=0, stepLocal_4=128, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=0, var_1_9=126] [L150] RET step() [L151] CALL, EXPR property() [L141-L142] return ((((((32u >= last_1_var_1_12) ? ((last_1_var_1_12 <= last_1_var_1_12) ? (((var_1_4 - var_1_5) >= last_1_var_1_17) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((! (var_1_17 > var_1_5)) ? (var_1_8 == ((signed char) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11))) : (var_1_8 == ((signed char) -4)))) && ((var_1_21 && var_1_21) ? (var_1_12 == ((unsigned long int) var_1_11)) : (var_1_21 ? (var_1_12 == ((unsigned long int) (((((var_1_19) > ((var_1_11 + var_1_7))) ? (var_1_19) : ((var_1_11 + var_1_7)))) + (var_1_15 - var_1_1)))) : 1))) && (((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) ? (var_1_17 == ((double) var_1_18)) : 1)) && ((last_1_var_1_21 || (((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18)) ? ((var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17)))) ? (var_1_19 == ((unsigned long int) last_1_var_1_1)) : (var_1_19 == ((unsigned long int) var_1_11))) : (var_1_19 == ((unsigned long int) last_1_var_1_1)))) && (((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) ? (var_1_13 ? ((var_1_1 < var_1_19) ? (var_1_21 == ((unsigned char) (! var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_23))) ; [L151] RET, EXPR property() [L151] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=0, var_1_9=126] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=0, var_1_9=126] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 465 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 438 mSDsluCounter, 1453 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 858 mSDsCounter, 258 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 587 IncrementalHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 258 mSolverCounterUnsat, 595 mSDtfsCounter, 587 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 900 GetRequests, 855 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=266occurred in iteration=4, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 250 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1331 NumberOfCodeBlocks, 1331 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1453 ConstructedInterpolants, 0 QuantifiedInterpolants, 2967 SizeOfPredicates, 8 NumberOfNonLiveVariables, 640 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 9114/9240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-20 21:50:01,430 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...