/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-97.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 03:31:10,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 03:31:10,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 03:31:10,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 03:31:10,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 03:31:10,761 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 03:31:10,762 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 03:31:10,762 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 03:31:10,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 03:31:10,765 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 03:31:10,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 03:31:10,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 03:31:10,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 03:31:10,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 03:31:10,782 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 03:31:10,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 03:31:10,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 03:31:10,783 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 03:31:10,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 03:31:10,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 03:31:10,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 03:31:10,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 03:31:10,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 03:31:10,784 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 03:31:10,784 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 03:31:10,784 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 03:31:10,784 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 03:31:10,785 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 03:31:10,785 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 03:31:10,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 03:31:10,786 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 03:31:10,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 03:31:10,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:31:10,786 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 03:31:10,787 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 03:31:10,787 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 03:31:10,787 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 03:31:10,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 03:31:10,787 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 03:31:10,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 03:31:10,787 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 03:31:10,788 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 03:31:10,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 03:31:10,788 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 03:31:10,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 03:31:11,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 03:31:11,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 03:31:11,007 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 03:31:11,008 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 03:31:11,009 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-97.i [2023-12-16 03:31:12,133 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 03:31:12,329 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 03:31:12,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-97.i [2023-12-16 03:31:12,336 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac75e8083/9127028643584fa98a5a61a2c7b9918d/FLAG1ac64a7ef [2023-12-16 03:31:12,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac75e8083/9127028643584fa98a5a61a2c7b9918d [2023-12-16 03:31:12,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 03:31:12,351 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 03:31:12,352 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 03:31:12,352 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 03:31:12,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 03:31:12,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:31:12" (1/1) ... [2023-12-16 03:31:12,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f41b095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:31:12, skipping insertion in model container [2023-12-16 03:31:12,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:31:12" (1/1) ... [2023-12-16 03:31:12,378 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 03:31:12,475 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-97.i[913,926] [2023-12-16 03:31:12,519 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:31:12,529 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 03:31:12,545 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-97.i[913,926] [2023-12-16 03:31:12,577 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:31:12,596 INFO L206 MainTranslator]: Completed translation [2023-12-16 03:31:12,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:31:12 WrapperNode [2023-12-16 03:31:12,597 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 03:31:12,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 03:31:12,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 03:31:12,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 03:31:12,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:31:12" (1/1) ... [2023-12-16 03:31:12,612 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:31:12" (1/1) ... [2023-12-16 03:31:12,643 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2023-12-16 03:31:12,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 03:31:12,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 03:31:12,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 03:31:12,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 03:31:12,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:31:12" (1/1) ... [2023-12-16 03:31:12,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:31:12" (1/1) ... [2023-12-16 03:31:12,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:31:12" (1/1) ... [2023-12-16 03:31:12,668 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-16 03:31:12,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:31:12" (1/1) ... [2023-12-16 03:31:12,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:31:12" (1/1) ... [2023-12-16 03:31:12,675 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:31:12" (1/1) ... [2023-12-16 03:31:12,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:31:12" (1/1) ... [2023-12-16 03:31:12,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:31:12" (1/1) ... [2023-12-16 03:31:12,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:31:12" (1/1) ... [2023-12-16 03:31:12,683 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 03:31:12,683 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 03:31:12,683 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 03:31:12,684 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 03:31:12,684 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:31:12" (1/1) ... [2023-12-16 03:31:12,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:31:12,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:31:12,748 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 03:31:12,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 03:31:12,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 03:31:12,769 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 03:31:12,769 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 03:31:12,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 03:31:12,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 03:31:12,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 03:31:12,846 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 03:31:12,848 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 03:31:13,064 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 03:31:13,105 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 03:31:13,106 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 03:31:13,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:31:13 BoogieIcfgContainer [2023-12-16 03:31:13,106 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 03:31:13,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 03:31:13,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 03:31:13,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 03:31:13,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:31:12" (1/3) ... [2023-12-16 03:31:13,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d14a67e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:31:13, skipping insertion in model container [2023-12-16 03:31:13,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:31:12" (2/3) ... [2023-12-16 03:31:13,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d14a67e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:31:13, skipping insertion in model container [2023-12-16 03:31:13,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:31:13" (3/3) ... [2023-12-16 03:31:13,128 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-97.i [2023-12-16 03:31:13,181 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 03:31:13,182 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 03:31:13,248 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 03:31:13,268 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;@1b02bdf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 03:31:13,269 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 03:31:13,272 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 40 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 03:31:13,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-16 03:31:13,281 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:31:13,281 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:31:13,282 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:31:13,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:31:13,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1557723872, now seen corresponding path program 1 times [2023-12-16 03:31:13,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:31:13,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443514507] [2023-12-16 03:31:13,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:31:13,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:31:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:31:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 03:31:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 03:31:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:31:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 03:31:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:31:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:31:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:31:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 03:31:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-16 03:31:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 03:31:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-16 03:31:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 03:31:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 03:31:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 03:31:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 03:31:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,636 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 03:31:13,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:31:13,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443514507] [2023-12-16 03:31:13,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443514507] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:31:13,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:31:13,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 03:31:13,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867277731] [2023-12-16 03:31:13,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:31:13,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 03:31:13,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:31:13,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 03:31:13,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:31:13,670 INFO L87 Difference]: Start difference. First operand has 58 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 40 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 03:31:13,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:31:13,715 INFO L93 Difference]: Finished difference Result 113 states and 192 transitions. [2023-12-16 03:31:13,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 03:31:13,718 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 105 [2023-12-16 03:31:13,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:31:13,724 INFO L225 Difference]: With dead ends: 113 [2023-12-16 03:31:13,724 INFO L226 Difference]: Without dead ends: 56 [2023-12-16 03:31:13,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:31:13,731 INFO L413 NwaCegarLoop]: 81 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, 81 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-16 03:31:13,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:31:13,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-16 03:31:13,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-12-16 03:31:13,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 03:31:13,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 84 transitions. [2023-12-16 03:31:13,775 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 84 transitions. Word has length 105 [2023-12-16 03:31:13,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:31:13,776 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 84 transitions. [2023-12-16 03:31:13,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 03:31:13,776 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 84 transitions. [2023-12-16 03:31:13,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-16 03:31:13,780 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:31:13,780 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:31:13,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 03:31:13,780 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:31:13,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:31:13,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1190448860, now seen corresponding path program 1 times [2023-12-16 03:31:13,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:31:13,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932176180] [2023-12-16 03:31:13,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:31:13,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:31:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:31:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 03:31:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 03:31:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:31:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 03:31:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:31:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:31:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:31:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 03:31:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-16 03:31:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 03:31:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-16 03:31:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:13,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 03:31:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 03:31:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 03:31:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 03:31:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 03:31:14,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:31:14,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932176180] [2023-12-16 03:31:14,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932176180] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:31:14,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:31:14,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 03:31:14,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892439999] [2023-12-16 03:31:14,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:31:14,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 03:31:14,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:31:14,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 03:31:14,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:31:14,016 INFO L87 Difference]: Start difference. First operand 56 states and 84 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 03:31:14,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:31:14,063 INFO L93 Difference]: Finished difference Result 163 states and 244 transitions. [2023-12-16 03:31:14,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 03:31:14,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2023-12-16 03:31:14,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:31:14,065 INFO L225 Difference]: With dead ends: 163 [2023-12-16 03:31:14,065 INFO L226 Difference]: Without dead ends: 108 [2023-12-16 03:31:14,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:31:14,066 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 73 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:31:14,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 209 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:31:14,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-16 03:31:14,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 69. [2023-12-16 03:31:14,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 03:31:14,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 102 transitions. [2023-12-16 03:31:14,081 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 102 transitions. Word has length 105 [2023-12-16 03:31:14,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:31:14,082 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 102 transitions. [2023-12-16 03:31:14,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 03:31:14,082 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 102 transitions. [2023-12-16 03:31:14,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-16 03:31:14,083 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:31:14,083 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:31:14,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 03:31:14,084 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:31:14,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:31:14,085 INFO L85 PathProgramCache]: Analyzing trace with hash -932283422, now seen corresponding path program 1 times [2023-12-16 03:31:14,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:31:14,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552962573] [2023-12-16 03:31:14,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:31:14,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:31:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:31:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 03:31:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 03:31:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:31:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 03:31:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:31:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:31:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:31:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 03:31:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-16 03:31:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 03:31:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-16 03:31:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 03:31:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 03:31:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 03:31:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 03:31:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 03:31:14,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:31:14,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552962573] [2023-12-16 03:31:14,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552962573] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:31:14,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:31:14,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 03:31:14,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545545920] [2023-12-16 03:31:14,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:31:14,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 03:31:14,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:31:14,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 03:31:14,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 03:31:14,460 INFO L87 Difference]: Start difference. First operand 69 states and 102 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 03:31:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:31:14,707 INFO L93 Difference]: Finished difference Result 235 states and 350 transitions. [2023-12-16 03:31:14,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 03:31:14,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2023-12-16 03:31:14,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:31:14,710 INFO L225 Difference]: With dead ends: 235 [2023-12-16 03:31:14,710 INFO L226 Difference]: Without dead ends: 167 [2023-12-16 03:31:14,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-16 03:31:14,711 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 138 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 03:31:14,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 263 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 03:31:14,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-12-16 03:31:14,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 133. [2023-12-16 03:31:14,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 98 states have (on average 1.3673469387755102) internal successors, (134), 98 states have internal predecessors, (134), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-16 03:31:14,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 198 transitions. [2023-12-16 03:31:14,741 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 198 transitions. Word has length 105 [2023-12-16 03:31:14,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:31:14,742 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 198 transitions. [2023-12-16 03:31:14,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 03:31:14,742 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 198 transitions. [2023-12-16 03:31:14,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-16 03:31:14,747 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:31:14,747 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:31:14,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 03:31:14,747 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:31:14,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:31:14,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1318033651, now seen corresponding path program 1 times [2023-12-16 03:31:14,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:31:14,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578128741] [2023-12-16 03:31:14,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:31:14,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:31:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:31:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 03:31:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 03:31:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:31:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 03:31:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:31:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:31:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:31:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 03:31:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-16 03:31:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 03:31:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-16 03:31:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 03:31:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 03:31:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 03:31:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 03:31:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:14,994 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 03:31:14,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:31:14,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578128741] [2023-12-16 03:31:14,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578128741] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:31:14,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:31:14,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 03:31:14,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819773824] [2023-12-16 03:31:14,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:31:14,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 03:31:14,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:31:14,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 03:31:14,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 03:31:14,995 INFO L87 Difference]: Start difference. First operand 133 states and 198 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 03:31:15,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:31:15,214 INFO L93 Difference]: Finished difference Result 287 states and 424 transitions. [2023-12-16 03:31:15,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 03:31:15,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 106 [2023-12-16 03:31:15,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:31:15,216 INFO L225 Difference]: With dead ends: 287 [2023-12-16 03:31:15,216 INFO L226 Difference]: Without dead ends: 219 [2023-12-16 03:31:15,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 03:31:15,218 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 135 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:31:15,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 459 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:31:15,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-12-16 03:31:15,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 136. [2023-12-16 03:31:15,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 101 states have internal predecessors, (138), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-16 03:31:15,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 202 transitions. [2023-12-16 03:31:15,264 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 202 transitions. Word has length 106 [2023-12-16 03:31:15,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:31:15,264 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 202 transitions. [2023-12-16 03:31:15,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 03:31:15,264 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 202 transitions. [2023-12-16 03:31:15,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-16 03:31:15,266 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:31:15,266 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:31:15,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 03:31:15,267 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:31:15,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:31:15,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1757931606, now seen corresponding path program 1 times [2023-12-16 03:31:15,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:31:15,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297004423] [2023-12-16 03:31:15,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:31:15,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:31:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:31:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 03:31:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 03:31:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:31:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 03:31:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:31:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:31:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:31:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 03:31:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-16 03:31:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 03:31:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-16 03:31:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 03:31:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 03:31:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 03:31:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 03:31:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,539 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 03:31:15,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:31:15,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297004423] [2023-12-16 03:31:15,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297004423] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:31:15,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:31:15,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 03:31:15,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074672007] [2023-12-16 03:31:15,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:31:15,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 03:31:15,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:31:15,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 03:31:15,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-16 03:31:15,540 INFO L87 Difference]: Start difference. First operand 136 states and 202 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 03:31:15,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:31:15,726 INFO L93 Difference]: Finished difference Result 353 states and 521 transitions. [2023-12-16 03:31:15,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 03:31:15,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 106 [2023-12-16 03:31:15,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:31:15,727 INFO L225 Difference]: With dead ends: 353 [2023-12-16 03:31:15,728 INFO L226 Difference]: Without dead ends: 218 [2023-12-16 03:31:15,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-16 03:31:15,743 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 87 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:31:15,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 403 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:31:15,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-12-16 03:31:15,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 206. [2023-12-16 03:31:15,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 154 states have (on average 1.3376623376623376) internal successors, (206), 154 states have internal predecessors, (206), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-16 03:31:15,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 302 transitions. [2023-12-16 03:31:15,764 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 302 transitions. Word has length 106 [2023-12-16 03:31:15,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:31:15,775 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 302 transitions. [2023-12-16 03:31:15,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 03:31:15,776 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 302 transitions. [2023-12-16 03:31:15,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-16 03:31:15,776 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:31:15,777 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:31:15,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 03:31:15,777 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:31:15,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:31:15,777 INFO L85 PathProgramCache]: Analyzing trace with hash 359540003, now seen corresponding path program 1 times [2023-12-16 03:31:15,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:31:15,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292299153] [2023-12-16 03:31:15,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:31:15,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:31:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:31:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 03:31:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 03:31:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:31:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 03:31:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:31:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:31:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:31:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 03:31:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-16 03:31:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 03:31:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-16 03:31:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 03:31:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 03:31:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 03:31:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 03:31:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:15,980 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 03:31:15,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:31:15,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292299153] [2023-12-16 03:31:15,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292299153] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:31:15,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:31:15,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 03:31:15,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253058793] [2023-12-16 03:31:15,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:31:15,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 03:31:15,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:31:15,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 03:31:15,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 03:31:15,982 INFO L87 Difference]: Start difference. First operand 206 states and 302 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 03:31:16,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:31:16,032 INFO L93 Difference]: Finished difference Result 443 states and 651 transitions. [2023-12-16 03:31:16,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 03:31:16,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2023-12-16 03:31:16,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:31:16,034 INFO L225 Difference]: With dead ends: 443 [2023-12-16 03:31:16,034 INFO L226 Difference]: Without dead ends: 238 [2023-12-16 03:31:16,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-16 03:31:16,036 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 70 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:31:16,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 299 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:31:16,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-12-16 03:31:16,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 206. [2023-12-16 03:31:16,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 154 states have (on average 1.2857142857142858) internal successors, (198), 154 states have internal predecessors, (198), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-16 03:31:16,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 294 transitions. [2023-12-16 03:31:16,098 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 294 transitions. Word has length 107 [2023-12-16 03:31:16,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:31:16,098 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 294 transitions. [2023-12-16 03:31:16,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 03:31:16,099 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 294 transitions. [2023-12-16 03:31:16,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-16 03:31:16,099 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:31:16,100 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:31:16,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 03:31:16,100 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:31:16,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:31:16,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1734094653, now seen corresponding path program 1 times [2023-12-16 03:31:16,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:31:16,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859448964] [2023-12-16 03:31:16,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:31:16,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:31:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:31:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 03:31:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 03:31:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:31:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 03:31:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:31:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:31:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:31:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 03:31:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-16 03:31:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 03:31:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-16 03:31:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 03:31:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 03:31:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 03:31:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 03:31:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,297 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 03:31:16,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:31:16,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859448964] [2023-12-16 03:31:16,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859448964] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:31:16,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:31:16,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 03:31:16,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023011730] [2023-12-16 03:31:16,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:31:16,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 03:31:16,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:31:16,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 03:31:16,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 03:31:16,301 INFO L87 Difference]: Start difference. First operand 206 states and 294 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 03:31:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:31:16,611 INFO L93 Difference]: Finished difference Result 532 states and 751 transitions. [2023-12-16 03:31:16,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 03:31:16,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2023-12-16 03:31:16,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:31:16,615 INFO L225 Difference]: With dead ends: 532 [2023-12-16 03:31:16,615 INFO L226 Difference]: Without dead ends: 461 [2023-12-16 03:31:16,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 03:31:16,619 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 160 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 03:31:16,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 346 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 03:31:16,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2023-12-16 03:31:16,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 345. [2023-12-16 03:31:16,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 259 states have (on average 1.2972972972972974) internal successors, (336), 259 states have internal predecessors, (336), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-16 03:31:16,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 496 transitions. [2023-12-16 03:31:16,680 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 496 transitions. Word has length 110 [2023-12-16 03:31:16,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:31:16,680 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 496 transitions. [2023-12-16 03:31:16,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 03:31:16,680 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 496 transitions. [2023-12-16 03:31:16,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-16 03:31:16,681 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:31:16,681 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:31:16,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 03:31:16,681 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:31:16,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:31:16,682 INFO L85 PathProgramCache]: Analyzing trace with hash -829671378, now seen corresponding path program 1 times [2023-12-16 03:31:16,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:31:16,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022749882] [2023-12-16 03:31:16,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:31:16,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:31:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:31:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 03:31:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 03:31:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:31:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 03:31:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:31:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:31:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:31:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 03:31:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-16 03:31:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 03:31:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-16 03:31:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 03:31:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 03:31:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 03:31:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 03:31:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 03:31:16,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:31:16,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022749882] [2023-12-16 03:31:16,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022749882] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:31:16,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:31:16,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 03:31:16,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070101659] [2023-12-16 03:31:16,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:31:16,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 03:31:16,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:31:16,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 03:31:16,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:31:16,749 INFO L87 Difference]: Start difference. First operand 345 states and 496 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 03:31:16,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:31:16,838 INFO L93 Difference]: Finished difference Result 718 states and 1035 transitions. [2023-12-16 03:31:16,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 03:31:16,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2023-12-16 03:31:16,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:31:16,840 INFO L225 Difference]: With dead ends: 718 [2023-12-16 03:31:16,840 INFO L226 Difference]: Without dead ends: 374 [2023-12-16 03:31:16,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:31:16,842 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 61 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:31:16,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 143 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:31:16,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2023-12-16 03:31:16,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 297. [2023-12-16 03:31:16,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 211 states have (on average 1.2085308056872037) internal successors, (255), 211 states have internal predecessors, (255), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-16 03:31:16,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 415 transitions. [2023-12-16 03:31:16,899 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 415 transitions. Word has length 111 [2023-12-16 03:31:16,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:31:16,899 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 415 transitions. [2023-12-16 03:31:16,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 03:31:16,900 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 415 transitions. [2023-12-16 03:31:16,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-16 03:31:16,900 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:31:16,900 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:31:16,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 03:31:16,901 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:31:16,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:31:16,901 INFO L85 PathProgramCache]: Analyzing trace with hash -772413076, now seen corresponding path program 1 times [2023-12-16 03:31:16,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:31:16,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224882465] [2023-12-16 03:31:16,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:31:16,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:31:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:45,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:31:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:45,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 03:31:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:45,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 03:31:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:45,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:31:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:45,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 03:31:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:45,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:31:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:45,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:31:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:45,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:31:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:45,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 03:31:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:45,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-16 03:31:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:45,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 03:31:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:45,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-16 03:31:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:45,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 03:31:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:45,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 03:31:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:45,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 03:31:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:45,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 03:31:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:31:45,675 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 03:31:45,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:31:45,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224882465] [2023-12-16 03:31:45,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224882465] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:31:45,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:31:45,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-16 03:31:45,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182490844] [2023-12-16 03:31:45,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:31:45,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 03:31:45,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:31:45,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 03:31:45,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2023-12-16 03:31:45,693 INFO L87 Difference]: Start difference. First operand 297 states and 415 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 03:31:55,491 WARN L293 SmtUtils]: Spent 7.29s on a formula simplification that was a NOOP. DAG size: 145 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-16 03:31:55,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:31:55,904 INFO L93 Difference]: Finished difference Result 530 states and 693 transitions. [2023-12-16 03:31:55,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 03:31:55,905 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2023-12-16 03:31:55,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:31:55,907 INFO L225 Difference]: With dead ends: 530 [2023-12-16 03:31:55,908 INFO L226 Difference]: Without dead ends: 528 [2023-12-16 03:31:55,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2023-12-16 03:31:55,908 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 126 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-16 03:31:55,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 321 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-16 03:31:55,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2023-12-16 03:31:55,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 477. [2023-12-16 03:31:55,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 376 states have (on average 1.2127659574468086) internal successors, (456), 381 states have internal predecessors, (456), 90 states have call successors, (90), 10 states have call predecessors, (90), 10 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-16 03:31:55,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 636 transitions. [2023-12-16 03:31:55,981 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 636 transitions. Word has length 111 [2023-12-16 03:31:55,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:31:55,981 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 636 transitions. [2023-12-16 03:31:55,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 03:31:55,981 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 636 transitions. [2023-12-16 03:31:55,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-16 03:31:55,982 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:31:55,982 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:31:55,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 03:31:55,983 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:31:55,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:31:55,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1590061526, now seen corresponding path program 1 times [2023-12-16 03:31:55,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:31:55,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556505220] [2023-12-16 03:31:55,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:31:55,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:31:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 03:31:56,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 03:31:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 03:31:56,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 03:31:56,079 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 03:31:56,080 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 03:31:56,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 03:31:56,083 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:31:56,085 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 03:31:56,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:31:56 BoogieIcfgContainer [2023-12-16 03:31:56,132 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 03:31:56,132 INFO L158 Benchmark]: Toolchain (without parser) took 43780.89ms. Allocated memory was 283.1MB in the beginning and 588.3MB in the end (delta: 305.1MB). Free memory was 231.2MB in the beginning and 205.2MB in the end (delta: 25.9MB). Peak memory consumption was 332.1MB. Max. memory is 8.0GB. [2023-12-16 03:31:56,132 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 168.8MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 03:31:56,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.81ms. Allocated memory is still 283.1MB. Free memory was 230.7MB in the beginning and 217.0MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 03:31:56,132 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.69ms. Allocated memory is still 283.1MB. Free memory was 216.5MB in the beginning and 212.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 03:31:56,133 INFO L158 Benchmark]: Boogie Preprocessor took 38.60ms. Allocated memory is still 283.1MB. Free memory was 212.8MB in the beginning and 206.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-16 03:31:56,133 INFO L158 Benchmark]: RCFGBuilder took 423.05ms. Allocated memory is still 283.1MB. Free memory was 206.5MB in the beginning and 183.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-16 03:31:56,133 INFO L158 Benchmark]: TraceAbstraction took 43010.15ms. Allocated memory was 283.1MB in the beginning and 588.3MB in the end (delta: 305.1MB). Free memory was 250.5MB in the beginning and 205.2MB in the end (delta: 45.3MB). Peak memory consumption was 349.9MB. Max. memory is 8.0GB. [2023-12-16 03:31:56,134 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.13ms. Allocated memory is still 168.8MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.81ms. Allocated memory is still 283.1MB. Free memory was 230.7MB in the beginning and 217.0MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.69ms. Allocated memory is still 283.1MB. Free memory was 216.5MB in the beginning and 212.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.60ms. Allocated memory is still 283.1MB. Free memory was 212.8MB in the beginning and 206.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 423.05ms. Allocated memory is still 283.1MB. Free memory was 206.5MB in the beginning and 183.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 43010.15ms. Allocated memory was 283.1MB in the beginning and 588.3MB in the end (delta: 305.1MB). Free memory was 250.5MB in the beginning and 205.2MB in the end (delta: 45.3MB). Peak memory consumption was 349.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of bitwise operation at line 122. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed long int last_1_var_1_5 = 5; [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] CALL updateLastVariables() [L119] last_1_var_1_5 = var_1_5 [L129] RET updateLastVariables() [L130] CALL updateVariables() [L92] var_1_9 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L93] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L94] var_1_10 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L95] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L96] var_1_11 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L97] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L98] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L98] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L99] var_1_12 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L100] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L101] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L101] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L102] var_1_13 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L103] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L104] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L104] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L105] var_1_14 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L106] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L107] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L107] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L108] var_1_18 = __VERIFIER_nondet_char() [L109] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L109] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L110] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L110] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L111] var_1_19 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L112] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L113] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L113] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L114] var_1_23 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L115] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L116] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L116] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L130] RET updateVariables() [L131] CALL step() [L43] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L46] var_1_20 = var_1_8 [L47] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L48] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L51] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=-1, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L52] COND FALSE !(\read(var_1_22)) [L59] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L61] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L62] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L63] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L64] COND FALSE !(\read(var_1_22)) [L71] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L76] signed long int stepLocal_4 = 256; [L77] unsigned char stepLocal_3 = var_1_22; [L78] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L79] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L82] COND FALSE !(stepLocal_3 || var_1_22) [L87] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L131] RET step() [L132] CALL, EXPR property() [L122] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122-L123] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=40, var_1_14=19, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.9s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 850 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 850 mSDsluCounter, 2524 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1535 mSDsCounter, 238 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 878 IncrementalHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 238 mSolverCounterUnsat, 989 mSDtfsCounter, 878 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 372 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=477occurred in iteration=9, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 444 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 30.3s InterpolantComputationTime, 1077 NumberOfCodeBlocks, 1077 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 957 ConstructedInterpolants, 0 QuantifiedInterpolants, 13819 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 4320/4320 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-16 03:31:56,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...