/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_floatingpointinfluence_no-floats_file-70.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 22:20:11,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 22:20:11,137 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 22:20:11,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 22:20:11,143 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 22:20:11,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 22:20:11,171 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 22:20:11,171 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 22:20:11,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 22:20:11,175 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 22:20:11,175 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 22:20:11,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 22:20:11,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 22:20:11,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 22:20:11,177 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 22:20:11,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 22:20:11,178 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 22:20:11,178 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 22:20:11,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 22:20:11,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 22:20:11,179 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 22:20:11,179 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 22:20:11,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 22:20:11,179 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 22:20:11,180 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 22:20:11,180 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 22:20:11,180 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 22:20:11,180 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 22:20:11,181 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 22:20:11,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 22:20:11,182 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 22:20:11,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 22:20:11,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:20:11,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 22:20:11,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 22:20:11,183 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 22:20:11,183 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 22:20:11,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 22:20:11,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 22:20:11,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 22:20:11,183 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 22:20:11,184 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 22:20:11,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 22:20:11,184 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-20 22:20:11,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 22:20:11,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 22:20:11,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 22:20:11,438 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 22:20:11,438 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 22:20:11,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i [2023-12-20 22:20:12,618 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 22:20:12,787 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 22:20:12,787 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i [2023-12-20 22:20:12,795 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/011fede30/4bcc1fa25e0a40bcb2dd7d32c82b9996/FLAGd49365397 [2023-12-20 22:20:12,807 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/011fede30/4bcc1fa25e0a40bcb2dd7d32c82b9996 [2023-12-20 22:20:12,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 22:20:12,810 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 22:20:12,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 22:20:12,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 22:20:12,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 22:20:12,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:20:12" (1/1) ... [2023-12-20 22:20:12,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57814822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:20:12, skipping insertion in model container [2023-12-20 22:20:12,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:20:12" (1/1) ... [2023-12-20 22:20:12,845 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 22:20:12,957 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_floatingpointinfluence_no-floats_file-70.i[916,929] [2023-12-20 22:20:12,994 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:20:13,009 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 22:20:13,018 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_floatingpointinfluence_no-floats_file-70.i[916,929] [2023-12-20 22:20:13,041 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:20:13,056 INFO L206 MainTranslator]: Completed translation [2023-12-20 22:20:13,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:20:13 WrapperNode [2023-12-20 22:20:13,057 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 22:20:13,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 22:20:13,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 22:20:13,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 22:20:13,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:20:13" (1/1) ... [2023-12-20 22:20:13,070 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:20:13" (1/1) ... [2023-12-20 22:20:13,127 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2023-12-20 22:20:13,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 22:20:13,129 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 22:20:13,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 22:20:13,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 22:20:13,138 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:20:13" (1/1) ... [2023-12-20 22:20:13,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:20:13" (1/1) ... [2023-12-20 22:20:13,160 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:20:13" (1/1) ... [2023-12-20 22:20:13,178 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-20 22:20:13,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:20:13" (1/1) ... [2023-12-20 22:20:13,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:20:13" (1/1) ... [2023-12-20 22:20:13,183 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:20:13" (1/1) ... [2023-12-20 22:20:13,185 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:20:13" (1/1) ... [2023-12-20 22:20:13,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:20:13" (1/1) ... [2023-12-20 22:20:13,187 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:20:13" (1/1) ... [2023-12-20 22:20:13,203 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 22:20:13,204 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 22:20:13,205 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 22:20:13,205 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 22:20:13,205 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:20:13" (1/1) ... [2023-12-20 22:20:13,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:20:13,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:20:13,236 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-20 22:20:13,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-20 22:20:13,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 22:20:13,275 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 22:20:13,275 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 22:20:13,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 22:20:13,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 22:20:13,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 22:20:13,357 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 22:20:13,358 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 22:20:13,593 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 22:20:13,630 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 22:20:13,631 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 22:20:13,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:20:13 BoogieIcfgContainer [2023-12-20 22:20:13,631 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 22:20:13,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 22:20:13,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 22:20:13,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 22:20:13,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 10:20:12" (1/3) ... [2023-12-20 22:20:13,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc7f4e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:20:13, skipping insertion in model container [2023-12-20 22:20:13,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:20:13" (2/3) ... [2023-12-20 22:20:13,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc7f4e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:20:13, skipping insertion in model container [2023-12-20 22:20:13,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:20:13" (3/3) ... [2023-12-20 22:20:13,641 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-70.i [2023-12-20 22:20:13,652 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 22:20:13,653 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 22:20:13,686 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 22:20:13,691 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;@18462ce7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 22:20:13,692 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 22:20:13,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 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-20 22:20:13,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-20 22:20:13,704 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:20:13,705 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] [2023-12-20 22:20:13,705 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:20:13,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:20:13,713 INFO L85 PathProgramCache]: Analyzing trace with hash -18730910, now seen corresponding path program 1 times [2023-12-20 22:20:13,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:20:13,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630947000] [2023-12-20 22:20:13,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:20:13,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:20:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:14,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:20:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:14,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:20:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:14,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:20:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:14,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:20:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:14,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:20:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:14,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:20:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:14,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:20:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:14,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:20:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:14,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:20:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:14,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:20:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:14,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:20:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:14,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:20:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:14,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:20:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:14,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:20:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:14,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:20:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:14,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:20:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:14,350 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-20 22:20:14,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:20:14,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630947000] [2023-12-20 22:20:14,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630947000] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:20:14,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:20:14,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 22:20:14,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970980543] [2023-12-20 22:20:14,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:20:14,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 22:20:14,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:20:14,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 22:20:14,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:20:14,381 INFO L87 Difference]: Start difference. First operand has 48 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 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 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-20 22:20:14,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:20:14,432 INFO L93 Difference]: Finished difference Result 93 states and 160 transitions. [2023-12-20 22:20:14,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 22:20:14,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 102 [2023-12-20 22:20:14,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:20:14,441 INFO L225 Difference]: With dead ends: 93 [2023-12-20 22:20:14,441 INFO L226 Difference]: Without dead ends: 46 [2023-12-20 22:20:14,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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-20 22:20:14,447 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:20:14,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:20:14,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-20 22:20:14,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-12-20 22:20:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 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-20 22:20:14,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2023-12-20 22:20:14,483 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 102 [2023-12-20 22:20:14,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:20:14,485 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2023-12-20 22:20:14,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-20 22:20:14,485 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2023-12-20 22:20:14,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-20 22:20:14,488 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:20:14,489 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] [2023-12-20 22:20:14,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 22:20:14,489 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:20:14,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:20:14,490 INFO L85 PathProgramCache]: Analyzing trace with hash 38527392, now seen corresponding path program 1 times [2023-12-20 22:20:14,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:20:14,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821766530] [2023-12-20 22:20:14,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:20:14,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:20:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:17,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:20:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:17,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:20:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:17,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:20:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:17,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:20:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:17,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:20:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:17,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:20:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:17,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:20:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:17,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:20:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:17,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:20:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:17,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:20:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:17,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:20:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:17,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:20:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:17,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:20:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:17,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:20:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:17,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:20:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:17,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:20:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:17,824 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-20 22:20:17,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:20:17,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821766530] [2023-12-20 22:20:17,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821766530] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:20:17,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:20:17,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 22:20:17,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759218678] [2023-12-20 22:20:17,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:20:17,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 22:20:17,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:20:17,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 22:20:17,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-20 22:20:17,838 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-20 22:20:18,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:20:18,546 INFO L93 Difference]: Finished difference Result 126 states and 176 transitions. [2023-12-20 22:20:18,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-20 22:20:18,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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 102 [2023-12-20 22:20:18,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:20:18,551 INFO L225 Difference]: With dead ends: 126 [2023-12-20 22:20:18,551 INFO L226 Difference]: Without dead ends: 81 [2023-12-20 22:20:18,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-12-20 22:20:18,553 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 132 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 22:20:18,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 143 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 22:20:18,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-20 22:20:18,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 58. [2023-12-20 22:20:18,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-20 22:20:18,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 81 transitions. [2023-12-20 22:20:18,568 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 81 transitions. Word has length 102 [2023-12-20 22:20:18,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:20:18,569 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 81 transitions. [2023-12-20 22:20:18,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-20 22:20:18,569 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 81 transitions. [2023-12-20 22:20:18,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-20 22:20:18,572 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:20:18,572 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] [2023-12-20 22:20:18,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 22:20:18,572 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:20:18,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:20:18,573 INFO L85 PathProgramCache]: Analyzing trace with hash 739591970, now seen corresponding path program 1 times [2023-12-20 22:20:18,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:20:18,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644717] [2023-12-20 22:20:18,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:20:18,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:20:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:20:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:20:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:20:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:20:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:20:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:20:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:20:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:20:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:20:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:20:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:20:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:20:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:20:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:20:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:20:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:20:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,076 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-20 22:20:24,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:20:24,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644717] [2023-12-20 22:20:24,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644717] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:20:24,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:20:24,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 22:20:24,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394855900] [2023-12-20 22:20:24,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:20:24,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 22:20:24,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:20:24,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 22:20:24,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-20 22:20:24,079 INFO L87 Difference]: Start difference. First operand 58 states and 81 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-20 22:20:24,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:20:24,328 INFO L93 Difference]: Finished difference Result 130 states and 180 transitions. [2023-12-20 22:20:24,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 22:20:24,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 102 [2023-12-20 22:20:24,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:20:24,331 INFO L225 Difference]: With dead ends: 130 [2023-12-20 22:20:24,331 INFO L226 Difference]: Without dead ends: 73 [2023-12-20 22:20:24,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-20 22:20:24,333 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 26 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 22:20:24,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 170 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 22:20:24,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-20 22:20:24,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 58. [2023-12-20 22:20:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-20 22:20:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 81 transitions. [2023-12-20 22:20:24,346 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 81 transitions. Word has length 102 [2023-12-20 22:20:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:20:24,346 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 81 transitions. [2023-12-20 22:20:24,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-20 22:20:24,347 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 81 transitions. [2023-12-20 22:20:24,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-20 22:20:24,349 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:20:24,350 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] [2023-12-20 22:20:24,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 22:20:24,350 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:20:24,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:20:24,350 INFO L85 PathProgramCache]: Analyzing trace with hash 296692830, now seen corresponding path program 1 times [2023-12-20 22:20:24,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:20:24,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308792579] [2023-12-20 22:20:24,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:20:24,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:20:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:20:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:20:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:20:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:20:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:20:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:20:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:20:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:20:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:20:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:20:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:20:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:20:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:20:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:20:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:20:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:20:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,417 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-20 22:20:24,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:20:24,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308792579] [2023-12-20 22:20:24,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308792579] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:20:24,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:20:24,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 22:20:24,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738273740] [2023-12-20 22:20:24,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:20:24,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 22:20:24,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:20:24,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 22:20:24,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:20:24,420 INFO L87 Difference]: Start difference. First operand 58 states and 81 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-20 22:20:24,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:20:24,447 INFO L93 Difference]: Finished difference Result 123 states and 170 transitions. [2023-12-20 22:20:24,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 22:20:24,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 102 [2023-12-20 22:20:24,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:20:24,449 INFO L225 Difference]: With dead ends: 123 [2023-12-20 22:20:24,449 INFO L226 Difference]: Without dead ends: 66 [2023-12-20 22:20:24,450 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-20 22:20:24,451 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 19 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:20:24,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 132 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:20:24,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-20 22:20:24,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2023-12-20 22:20:24,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-20 22:20:24,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2023-12-20 22:20:24,464 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 80 transitions. Word has length 102 [2023-12-20 22:20:24,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:20:24,465 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 80 transitions. [2023-12-20 22:20:24,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-20 22:20:24,465 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2023-12-20 22:20:24,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-20 22:20:24,467 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:20:24,467 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] [2023-12-20 22:20:24,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 22:20:24,467 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:20:24,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:20:24,468 INFO L85 PathProgramCache]: Analyzing trace with hash 997757408, now seen corresponding path program 1 times [2023-12-20 22:20:24,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:20:24,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688724533] [2023-12-20 22:20:24,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:20:24,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:20:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:20:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:20:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:20:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:20:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:20:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:20:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:20:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:20:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:20:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:20:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:20:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:20:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:20:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:20:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:20:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:20:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,617 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-20 22:20:24,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:20:24,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688724533] [2023-12-20 22:20:24,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688724533] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:20:24,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:20:24,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 22:20:24,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201433693] [2023-12-20 22:20:24,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:20:24,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 22:20:24,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:20:24,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 22:20:24,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 22:20:24,623 INFO L87 Difference]: Start difference. First operand 58 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-20 22:20:24,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:20:24,661 INFO L93 Difference]: Finished difference Result 123 states and 168 transitions. [2023-12-20 22:20:24,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 22:20:24,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 102 [2023-12-20 22:20:24,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:20:24,664 INFO L225 Difference]: With dead ends: 123 [2023-12-20 22:20:24,664 INFO L226 Difference]: Without dead ends: 66 [2023-12-20 22:20:24,665 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-20 22:20:24,667 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 14 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:20:24,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 203 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:20:24,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-20 22:20:24,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2023-12-20 22:20:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-20 22:20:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2023-12-20 22:20:24,688 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 102 [2023-12-20 22:20:24,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:20:24,691 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2023-12-20 22:20:24,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-20 22:20:24,692 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2023-12-20 22:20:24,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-20 22:20:24,694 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:20:24,695 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] [2023-12-20 22:20:24,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 22:20:24,696 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:20:24,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:20:24,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1954246297, now seen corresponding path program 1 times [2023-12-20 22:20:24,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:20:24,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415235846] [2023-12-20 22:20:24,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:20:24,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:20:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:20:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:20:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:20:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:20:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:20:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:20:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:20:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:20:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:20:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:20:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:20:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:20:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:20:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:20:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:20:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:20:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:24,962 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-20 22:20:24,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:20:24,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415235846] [2023-12-20 22:20:24,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415235846] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 22:20:24,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970719892] [2023-12-20 22:20:24,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:20:24,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 22:20:24,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:20:24,968 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 22:20:24,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 22:20:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:20:25,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-20 22:20:25,084 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 22:20:25,389 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 269 proven. 39 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2023-12-20 22:20:25,389 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 22:20:25,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970719892] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 22:20:25,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-20 22:20:25,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 11 [2023-12-20 22:20:25,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791534499] [2023-12-20 22:20:25,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-20 22:20:25,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-20 22:20:25,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:20:25,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-20 22:20:25,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2023-12-20 22:20:25,659 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2023-12-20 22:20:26,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:20:26,146 INFO L93 Difference]: Finished difference Result 141 states and 180 transitions. [2023-12-20 22:20:26,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-20 22:20:26,147 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 104 [2023-12-20 22:20:26,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:20:26,148 INFO L225 Difference]: With dead ends: 141 [2023-12-20 22:20:26,149 INFO L226 Difference]: Without dead ends: 91 [2023-12-20 22:20:26,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2023-12-20 22:20:26,150 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 163 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 22:20:26,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 105 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 22:20:26,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-20 22:20:26,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 62. [2023-12-20 22:20:26,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-20 22:20:26,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2023-12-20 22:20:26,168 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 104 [2023-12-20 22:20:26,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:20:26,169 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2023-12-20 22:20:26,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2023-12-20 22:20:26,170 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2023-12-20 22:20:26,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-20 22:20:26,172 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:20:26,172 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] [2023-12-20 22:20:26,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-20 22:20:26,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-20 22:20:26,379 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:20:26,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:20:26,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1753914985, now seen corresponding path program 1 times [2023-12-20 22:20:26,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:20:26,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589952481] [2023-12-20 22:20:26,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:20:26,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:20:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 22:20:26,426 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 22:20:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 22:20:26,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 22:20:26,484 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 22:20:26,485 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 22:20:26,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 22:20:26,490 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:20:26,493 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 22:20:26,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 10:20:26 BoogieIcfgContainer [2023-12-20 22:20:26,573 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 22:20:26,573 INFO L158 Benchmark]: Toolchain (without parser) took 13762.87ms. Allocated memory was 378.5MB in the beginning and 552.6MB in the end (delta: 174.1MB). Free memory was 316.9MB in the beginning and 471.8MB in the end (delta: -154.9MB). Peak memory consumption was 20.0MB. Max. memory is 8.0GB. [2023-12-20 22:20:26,574 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 206.6MB. Free memory was 156.6MB in the beginning and 156.4MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 22:20:26,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.70ms. Allocated memory is still 378.5MB. Free memory was 316.9MB in the beginning and 304.0MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-20 22:20:26,574 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.96ms. Allocated memory is still 378.5MB. Free memory was 304.0MB in the beginning and 301.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 22:20:26,574 INFO L158 Benchmark]: Boogie Preprocessor took 75.18ms. Allocated memory is still 378.5MB. Free memory was 301.2MB in the beginning and 297.7MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 22:20:26,575 INFO L158 Benchmark]: RCFGBuilder took 426.77ms. Allocated memory is still 378.5MB. Free memory was 297.7MB in the beginning and 333.6MB in the end (delta: -35.8MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. [2023-12-20 22:20:26,575 INFO L158 Benchmark]: TraceAbstraction took 12939.82ms. Allocated memory was 378.5MB in the beginning and 552.6MB in the end (delta: 174.1MB). Free memory was 332.5MB in the beginning and 471.8MB in the end (delta: -139.3MB). Peak memory consumption was 35.3MB. Max. memory is 8.0GB. [2023-12-20 22:20:26,576 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 206.6MB. Free memory was 156.6MB in the beginning and 156.4MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 245.70ms. Allocated memory is still 378.5MB. Free memory was 316.9MB in the beginning and 304.0MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.96ms. Allocated memory is still 378.5MB. Free memory was 304.0MB in the beginning and 301.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 75.18ms. Allocated memory is still 378.5MB. Free memory was 301.2MB in the beginning and 297.7MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 426.77ms. Allocated memory is still 378.5MB. Free memory was 297.7MB in the beginning and 333.6MB in the end (delta: -35.8MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. * TraceAbstraction took 12939.82ms. Allocated memory was 378.5MB in the beginning and 552.6MB in the end (delta: 174.1MB). Free memory was 332.5MB in the beginning and 471.8MB in the end (delta: -139.3MB). Peak memory consumption was 35.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwise operation at line 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_4 = 19138; [L25] signed char var_1_6 = 25; [L26] signed long int var_1_7 = -50; [L27] signed long int var_1_8 = 8; [L28] signed long int var_1_9 = 255; [L29] signed long int var_1_10 = 10000000; [L30] signed long int var_1_11 = 0; [L31] signed long int var_1_12 = 255; [L32] unsigned char var_1_13 = 50; [L33] unsigned char var_1_14 = 2; [L34] signed char var_1_15 = 1; [L35] signed char var_1_16 = 5; [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L63] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L63] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L64] var_1_4 = __VERIFIER_nondet_ushort() [L65] CALL assume_abort_if_not(var_1_4 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L65] RET assume_abort_if_not(var_1_4 >= 16383) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L66] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L66] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L67] var_1_9 = __VERIFIER_nondet_long() [L68] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L68] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L69] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L69] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L70] var_1_10 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L71] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L72] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L72] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L73] var_1_11 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_11 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L74] RET assume_abort_if_not(var_1_11 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L75] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L75] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L76] var_1_12 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L77] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L78] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L78] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L79] var_1_14 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L80] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L81] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L81] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L82] var_1_16 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L83] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L84] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L84] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L97] RET updateVariables() [L98] CALL step() [L39] var_1_13 = var_1_14 [L40] var_1_15 = var_1_16 VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=0, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L41] COND TRUE \read(var_1_2) [L42] var_1_1 = ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=0, var_1_16=0, var_1_1=46630, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L44] COND FALSE !(var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=0, var_1_16=0, var_1_1=46630, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L47] unsigned short int stepLocal_0 = var_1_4; [L48] EXPR var_1_13 << var_1_13 VAL [isInitial=1, stepLocal_0=29917, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=0, var_1_16=0, var_1_1=46630, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L48] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, stepLocal_0=29917, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=0, var_1_16=0, var_1_1=46630, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=2147483647] [L48] COND FALSE !(stepLocal_0 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) [L51] var_1_7 = (var_1_13 + (var_1_1 + var_1_4)) VAL [isInitial=1, stepLocal_0=29917, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=0, var_1_16=0, var_1_1=46630, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=76801, var_1_8=8, var_1_9=2147483647] [L53] unsigned char stepLocal_1 = var_1_13; VAL [isInitial=1, stepLocal_0=29917, stepLocal_1=254, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=0, var_1_16=0, var_1_1=46630, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=76801, var_1_8=8, var_1_9=2147483647] [L54] COND FALSE !(var_1_13 < stepLocal_1) [L57] var_1_8 = ((var_1_11 - var_1_12) - var_1_9) VAL [isInitial=1, stepLocal_0=29917, stepLocal_1=254, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=0, var_1_16=0, var_1_1=46630, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=76801, var_1_8=0, var_1_9=2147483647] [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4))))) [L89] EXPR var_1_13 << var_1_13 VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=0, var_1_16=0, var_1_1=46630, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=76801, var_1_8=0, var_1_9=2147483647] [L89] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) [L89] EXPR var_1_13 << var_1_13 [L89] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=0, var_1_16=0, var_1_1=46630, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=76801, var_1_8=0, var_1_9=2147483647] [L89] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=0, var_1_16=0, var_1_1=46630, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=76801, var_1_8=0, var_1_9=2147483647] [L89-L90] return (((((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4)))))) && ((var_1_13 < var_1_13) ? (var_1_8 == ((signed long int) (var_1_9 - var_1_10))) : (var_1_8 == ((signed long int) ((var_1_11 - var_1_12) - var_1_9))))) && (var_1_13 == ((unsigned char) var_1_14))) && (var_1_15 == ((signed char) var_1_16)) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=0, var_1_16=0, var_1_1=46630, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=76801, var_1_8=0, var_1_9=2147483647] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=0, var_1_16=0, var_1_1=46630, var_1_2=1, var_1_4=29917, var_1_6=25, var_1_7=76801, var_1_8=0, var_1_9=2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 7, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 355 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 355 mSDsluCounter, 866 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 499 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 525 IncrementalHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 367 mSDtfsCounter, 525 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 374 GetRequests, 330 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=6, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 90 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 822 NumberOfCodeBlocks, 822 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 711 ConstructedInterpolants, 0 QuantifiedInterpolants, 3458 SizeOfPredicates, 6 NumberOfNonLiveVariables, 257 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 3285/3360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-20 22:20:26,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...