/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_variablewrapping_normal_file-70.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:17:12,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:17:12,947 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 04:17:12,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:17:12,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:17:12,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:17:12,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:17:12,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:17:12,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:17:12,971 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:17:12,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:17:12,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:17:12,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:17:12,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:17:12,972 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:17:12,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:17:12,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:17:12,973 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:17:12,974 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:17:12,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:17:12,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:17:12,975 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:17:12,975 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:17:12,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:17:12,976 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:17:12,977 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:17:12,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:17:12,977 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:17:12,978 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:17:12,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:17:12,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:17:12,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:17:12,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:17:12,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:17:12,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:17:12,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:17:12,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:17:12,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:17:12,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:17:12,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:17:12,981 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:17:12,985 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:17:12,985 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:17:12,985 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 04:17:13,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:17:13,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:17:13,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:17:13,258 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:17:13,259 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:17:13,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-70.i [2023-12-16 04:17:14,471 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:17:14,654 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:17:14,654 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-70.i [2023-12-16 04:17:14,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffefd6b63/2ddc932fa53d41098167ae1bc7438ee2/FLAG4aa884016 [2023-12-16 04:17:15,070 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffefd6b63/2ddc932fa53d41098167ae1bc7438ee2 [2023-12-16 04:17:15,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:17:15,074 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:17:15,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:17:15,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:17:15,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:17:15,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:17:15" (1/1) ... [2023-12-16 04:17:15,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e614f60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:15, skipping insertion in model container [2023-12-16 04:17:15,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:17:15" (1/1) ... [2023-12-16 04:17:15,150 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:17:15,341 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_variablewrapping_normal_file-70.i[913,926] [2023-12-16 04:17:15,379 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:17:15,398 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:17:15,412 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_variablewrapping_normal_file-70.i[913,926] [2023-12-16 04:17:15,438 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:17:15,469 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:17:15,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:15 WrapperNode [2023-12-16 04:17:15,479 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:17:15,481 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:17:15,481 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:17:15,481 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:17:15,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:15" (1/1) ... [2023-12-16 04:17:15,519 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:15" (1/1) ... [2023-12-16 04:17:15,550 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2023-12-16 04:17:15,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:17:15,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:17:15,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:17:15,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:17:15,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:15" (1/1) ... [2023-12-16 04:17:15,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:15" (1/1) ... [2023-12-16 04:17:15,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:15" (1/1) ... [2023-12-16 04:17:15,587 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 04:17:15,587 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:15" (1/1) ... [2023-12-16 04:17:15,587 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:15" (1/1) ... [2023-12-16 04:17:15,599 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:15" (1/1) ... [2023-12-16 04:17:15,616 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:15" (1/1) ... [2023-12-16 04:17:15,618 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:15" (1/1) ... [2023-12-16 04:17:15,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:15" (1/1) ... [2023-12-16 04:17:15,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:17:15,623 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:17:15,623 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:17:15,624 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:17:15,624 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:15" (1/1) ... [2023-12-16 04:17:15,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:17:15,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:17:15,666 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 04:17:15,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 04:17:15,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:17:15,697 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:17:15,698 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:17:15,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:17:15,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:17:15,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:17:15,794 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:17:15,799 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:17:16,048 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:17:16,148 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:17:16,156 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:17:16,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:17:16 BoogieIcfgContainer [2023-12-16 04:17:16,156 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:17:16,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:17:16,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:17:16,162 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:17:16,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:17:15" (1/3) ... [2023-12-16 04:17:16,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46dc2ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:17:16, skipping insertion in model container [2023-12-16 04:17:16,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:15" (2/3) ... [2023-12-16 04:17:16,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46dc2ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:17:16, skipping insertion in model container [2023-12-16 04:17:16,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:17:16" (3/3) ... [2023-12-16 04:17:16,164 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-70.i [2023-12-16 04:17:16,207 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:17:16,207 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:17:16,260 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:17:16,265 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;@24b31ac3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:17:16,265 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:17:16,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:17:16,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-16 04:17:16,278 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:17:16,279 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:17:16,279 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:17:16,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:17:16,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1952958357, now seen corresponding path program 1 times [2023-12-16 04:17:16,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:17:16,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146920585] [2023-12-16 04:17:16,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:17:16,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:17:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:16,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:17:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:16,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:17:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:16,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:17:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:16,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:17:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:16,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 04:17:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:16,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 04:17:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:16,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 04:17:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:16,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 04:17:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:16,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-16 04:17:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:16,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:17:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:16,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:17:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:16,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-16 04:17:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:16,631 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:17:16,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:17:16,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146920585] [2023-12-16 04:17:16,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146920585] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:17:16,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:17:16,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:17:16,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771167861] [2023-12-16 04:17:16,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:17:16,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:17:16,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:17:16,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:17:16,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:17:16,684 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:17:16,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:17:16,775 INFO L93 Difference]: Finished difference Result 85 states and 140 transitions. [2023-12-16 04:17:16,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:17:16,778 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2023-12-16 04:17:16,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:17:16,785 INFO L225 Difference]: With dead ends: 85 [2023-12-16 04:17:16,786 INFO L226 Difference]: Without dead ends: 42 [2023-12-16 04:17:16,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:17:16,794 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:17:16,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:17:16,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-16 04:17:16,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-12-16 04:17:16,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:17:16,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2023-12-16 04:17:16,869 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 82 [2023-12-16 04:17:16,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:17:16,870 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2023-12-16 04:17:16,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:17:16,870 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2023-12-16 04:17:16,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-16 04:17:16,873 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:17:16,873 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:17:16,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:17:16,874 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:17:16,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:17:16,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1575463539, now seen corresponding path program 1 times [2023-12-16 04:17:16,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:17:16,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279654828] [2023-12-16 04:17:16,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:17:16,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:17:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:17,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:17:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:17,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:17:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:17,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:17:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:17,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:17:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:17,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 04:17:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:17,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 04:17:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:17,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 04:17:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:17,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 04:17:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:17,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-16 04:17:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:17,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:17:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:17,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:17:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:17,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-16 04:17:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:17,634 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:17:17,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:17:17,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279654828] [2023-12-16 04:17:17,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279654828] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:17:17,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:17:17,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:17:17,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293840138] [2023-12-16 04:17:17,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:17:17,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:17:17,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:17:17,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:17:17,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:17:17,638 INFO L87 Difference]: Start difference. First operand 42 states and 60 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:17:17,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:17:17,867 INFO L93 Difference]: Finished difference Result 129 states and 179 transitions. [2023-12-16 04:17:17,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:17:17,869 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2023-12-16 04:17:17,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:17:17,871 INFO L225 Difference]: With dead ends: 129 [2023-12-16 04:17:17,871 INFO L226 Difference]: Without dead ends: 88 [2023-12-16 04:17:17,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:17:17,874 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 64 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:17:17,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 222 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:17:17,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-16 04:17:17,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2023-12-16 04:17:17,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 49 states have internal predecessors, (64), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 04:17:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 92 transitions. [2023-12-16 04:17:17,906 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 92 transitions. Word has length 82 [2023-12-16 04:17:17,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:17:17,906 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 92 transitions. [2023-12-16 04:17:17,907 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:17:17,907 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 92 transitions. [2023-12-16 04:17:17,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-16 04:17:17,912 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:17:17,912 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:17:17,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:17:17,913 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:17:17,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:17:17,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1910157131, now seen corresponding path program 1 times [2023-12-16 04:17:17,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:17:17,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009088787] [2023-12-16 04:17:17,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:17:17,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:17:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:18,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:17:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:18,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:17:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:18,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:17:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:18,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:17:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:18,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 04:17:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:18,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 04:17:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:18,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 04:17:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:18,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 04:17:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:18,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-16 04:17:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:18,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:17:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:18,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:17:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:18,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-16 04:17:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:18,085 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:17:18,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:17:18,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009088787] [2023-12-16 04:17:18,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009088787] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:17:18,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:17:18,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:17:18,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226550180] [2023-12-16 04:17:18,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:17:18,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:17:18,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:17:18,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:17:18,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:17:18,092 INFO L87 Difference]: Start difference. First operand 65 states and 92 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:17:18,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:17:18,135 INFO L93 Difference]: Finished difference Result 129 states and 183 transitions. [2023-12-16 04:17:18,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:17:18,136 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2023-12-16 04:17:18,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:17:18,142 INFO L225 Difference]: With dead ends: 129 [2023-12-16 04:17:18,142 INFO L226 Difference]: Without dead ends: 65 [2023-12-16 04:17:18,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:17:18,152 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 97 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-16 04:17:18,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 97 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:17:18,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-16 04:17:18,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-12-16 04:17:18,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 49 states have internal predecessors, (62), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 04:17:18,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2023-12-16 04:17:18,172 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 82 [2023-12-16 04:17:18,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:17:18,173 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2023-12-16 04:17:18,173 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:17:18,173 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2023-12-16 04:17:18,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-16 04:17:18,174 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:17:18,174 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:17:18,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:17:18,174 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:17:18,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:17:18,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1967415433, now seen corresponding path program 1 times [2023-12-16 04:17:18,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:17:18,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469182712] [2023-12-16 04:17:18,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:17:18,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:17:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:20,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:17:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:20,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:17:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:20,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:17:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:20,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:17:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:20,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 04:17:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:20,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 04:17:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:20,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 04:17:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:20,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 04:17:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:20,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-16 04:17:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:20,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:17:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:20,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:17:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:20,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-16 04:17:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:17:20,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:17:20,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469182712] [2023-12-16 04:17:20,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469182712] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:17:20,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:17:20,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:17:20,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23640936] [2023-12-16 04:17:20,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:17:20,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:17:20,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:17:20,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:17:20,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:17:20,054 INFO L87 Difference]: Start difference. First operand 65 states and 90 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:17:20,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:17:20,319 INFO L93 Difference]: Finished difference Result 144 states and 196 transitions. [2023-12-16 04:17:20,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:17:20,320 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2023-12-16 04:17:20,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:17:20,321 INFO L225 Difference]: With dead ends: 144 [2023-12-16 04:17:20,321 INFO L226 Difference]: Without dead ends: 80 [2023-12-16 04:17:20,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:17:20,323 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 38 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:17:20,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 163 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:17:20,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-16 04:17:20,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2023-12-16 04:17:20,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 54 states have internal predecessors, (68), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 04:17:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2023-12-16 04:17:20,333 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 82 [2023-12-16 04:17:20,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:17:20,333 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2023-12-16 04:17:20,333 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:17:20,333 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2023-12-16 04:17:20,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-16 04:17:20,334 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:17:20,334 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:17:20,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:17:20,335 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:17:20,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:17:20,335 INFO L85 PathProgramCache]: Analyzing trace with hash -817140659, now seen corresponding path program 1 times [2023-12-16 04:17:20,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:17:20,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878742991] [2023-12-16 04:17:20,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:17:20,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:17:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:17:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:17:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:17:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:17:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 04:17:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 04:17:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 04:17:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 04:17:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-16 04:17:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:17:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:17:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-16 04:17:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:17:26,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:17:26,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878742991] [2023-12-16 04:17:26,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878742991] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:17:26,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:17:26,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:17:26,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560720192] [2023-12-16 04:17:26,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:17:26,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:17:26,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:17:26,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:17:26,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:17:26,134 INFO L87 Difference]: Start difference. First operand 70 states and 96 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:17:26,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:17:26,381 INFO L93 Difference]: Finished difference Result 141 states and 192 transitions. [2023-12-16 04:17:26,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:17:26,382 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2023-12-16 04:17:26,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:17:26,384 INFO L225 Difference]: With dead ends: 141 [2023-12-16 04:17:26,384 INFO L226 Difference]: Without dead ends: 72 [2023-12-16 04:17:26,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:17:26,385 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 30 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:17:26,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 127 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:17:26,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-16 04:17:26,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2023-12-16 04:17:26,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 49 states have internal predecessors, (61), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 04:17:26,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2023-12-16 04:17:26,395 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 82 [2023-12-16 04:17:26,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:17:26,395 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2023-12-16 04:17:26,396 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:17:26,396 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2023-12-16 04:17:26,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-16 04:17:26,397 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:17:26,397 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:17:26,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 04:17:26,397 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:17:26,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:17:26,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1260039799, now seen corresponding path program 1 times [2023-12-16 04:17:26,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:17:26,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564335021] [2023-12-16 04:17:26,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:17:26,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:17:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:17:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:17:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:17:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:17:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 04:17:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 04:17:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 04:17:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 04:17:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-16 04:17:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:17:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:17:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-16 04:17:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,464 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:17:26,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:17:26,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564335021] [2023-12-16 04:17:26,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564335021] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:17:26,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:17:26,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:17:26,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530998110] [2023-12-16 04:17:26,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:17:26,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:17:26,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:17:26,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:17:26,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:17:26,467 INFO L87 Difference]: Start difference. First operand 65 states and 89 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:17:26,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:17:26,492 INFO L93 Difference]: Finished difference Result 131 states and 178 transitions. [2023-12-16 04:17:26,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:17:26,493 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2023-12-16 04:17:26,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:17:26,495 INFO L225 Difference]: With dead ends: 131 [2023-12-16 04:17:26,495 INFO L226 Difference]: Without dead ends: 67 [2023-12-16 04:17:26,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:17:26,497 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 19 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 116 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-16 04:17:26,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 116 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:17:26,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-16 04:17:26,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2023-12-16 04:17:26,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 04:17:26,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 88 transitions. [2023-12-16 04:17:26,507 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 88 transitions. Word has length 82 [2023-12-16 04:17:26,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:17:26,507 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 88 transitions. [2023-12-16 04:17:26,508 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:17:26,508 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 88 transitions. [2023-12-16 04:17:26,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-16 04:17:26,509 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:17:26,509 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:17:26,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 04:17:26,509 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:17:26,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:17:26,510 INFO L85 PathProgramCache]: Analyzing trace with hash -558975221, now seen corresponding path program 1 times [2023-12-16 04:17:26,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:17:26,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377622373] [2023-12-16 04:17:26,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:17:26,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:17:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:17:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:17:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:17:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:17:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 04:17:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 04:17:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 04:17:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 04:17:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-16 04:17:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:17:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:17:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-16 04:17:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,656 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:17:26,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:17:26,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377622373] [2023-12-16 04:17:26,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377622373] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:17:26,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:17:26,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:17:26,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741645921] [2023-12-16 04:17:26,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:17:26,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:17:26,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:17:26,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:17:26,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:17:26,658 INFO L87 Difference]: Start difference. First operand 65 states and 88 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:17:26,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:17:26,689 INFO L93 Difference]: Finished difference Result 131 states and 176 transitions. [2023-12-16 04:17:26,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:17:26,690 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2023-12-16 04:17:26,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:17:26,691 INFO L225 Difference]: With dead ends: 131 [2023-12-16 04:17:26,691 INFO L226 Difference]: Without dead ends: 67 [2023-12-16 04:17:26,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:17:26,695 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 14 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 179 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-16 04:17:26,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 179 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:17:26,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-16 04:17:26,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2023-12-16 04:17:26,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 04:17:26,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2023-12-16 04:17:26,712 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 82 [2023-12-16 04:17:26,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:17:26,712 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2023-12-16 04:17:26,712 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:17:26,712 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2023-12-16 04:17:26,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-16 04:17:26,713 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:17:26,713 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:17:26,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 04:17:26,713 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:17:26,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:17:26,714 INFO L85 PathProgramCache]: Analyzing trace with hash 581789838, now seen corresponding path program 1 times [2023-12-16 04:17:26,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:17:26,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449903302] [2023-12-16 04:17:26,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:17:26,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:17:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:17:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:17:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:17:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:17:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 04:17:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 04:17:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 04:17:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 04:17:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-16 04:17:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:17:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:17:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-16 04:17:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:26,966 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-16 04:17:26,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:17:26,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449903302] [2023-12-16 04:17:26,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449903302] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:17:26,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47986187] [2023-12-16 04:17:26,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:17:26,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:17:26,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:17:26,970 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-16 04:17:26,995 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-16 04:17:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:27,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-16 04:17:27,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:17:27,375 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 173 proven. 27 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-16 04:17:27,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:17:27,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47986187] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:17:27,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:17:27,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 11 [2023-12-16 04:17:27,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208993946] [2023-12-16 04:17:27,797 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:17:27,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 04:17:27,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:17:27,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 04:17:27,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:17:27,798 INFO L87 Difference]: Start difference. First operand 65 states and 87 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, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-16 04:17:28,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:17:28,288 INFO L93 Difference]: Finished difference Result 147 states and 186 transitions. [2023-12-16 04:17:28,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-16 04:17:28,289 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, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 84 [2023-12-16 04:17:28,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:17:28,289 INFO L225 Difference]: With dead ends: 147 [2023-12-16 04:17:28,289 INFO L226 Difference]: Without dead ends: 83 [2023-12-16 04:17:28,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 128 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-16 04:17:28,291 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 122 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:17:28,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 119 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:17:28,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-16 04:17:28,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 54. [2023-12-16 04:17:28,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:17:28,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2023-12-16 04:17:28,300 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 84 [2023-12-16 04:17:28,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:17:28,301 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2023-12-16 04:17:28,301 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, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-16 04:17:28,301 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2023-12-16 04:17:28,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-16 04:17:28,302 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:17:28,302 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:17:28,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 04:17:28,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:17:28,508 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:17:28,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:17:28,509 INFO L85 PathProgramCache]: Analyzing trace with hash 388010834, now seen corresponding path program 1 times [2023-12-16 04:17:28,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:17:28,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873407960] [2023-12-16 04:17:28,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:17:28,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:17:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:28,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:17:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:28,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:17:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:28,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:17:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:28,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:17:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:28,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 04:17:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:28,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 04:17:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:28,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 04:17:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:28,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 04:17:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:28,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-16 04:17:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:28,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:17:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:28,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:17:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:28,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-16 04:17:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:28,734 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-16 04:17:28,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:17:28,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873407960] [2023-12-16 04:17:28,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873407960] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:17:28,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960032541] [2023-12-16 04:17:28,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:17:28,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:17:28,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:17:28,736 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:17:28,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 04:17:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:28,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 04:17:28,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:17:28,989 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-12-16 04:17:28,990 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:17:29,158 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-16 04:17:29,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960032541] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:17:29,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:17:29,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2023-12-16 04:17:29,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573251482] [2023-12-16 04:17:29,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:17:29,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 04:17:29,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:17:29,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 04:17:29,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:17:29,162 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2023-12-16 04:17:29,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:17:29,427 INFO L93 Difference]: Finished difference Result 116 states and 140 transitions. [2023-12-16 04:17:29,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 04:17:29,429 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 84 [2023-12-16 04:17:29,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:17:29,430 INFO L225 Difference]: With dead ends: 116 [2023-12-16 04:17:29,430 INFO L226 Difference]: Without dead ends: 63 [2023-12-16 04:17:29,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2023-12-16 04:17:29,432 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 41 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:17:29,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 162 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:17:29,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-16 04:17:29,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2023-12-16 04:17:29,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:17:29,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2023-12-16 04:17:29,446 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 84 [2023-12-16 04:17:29,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:17:29,447 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2023-12-16 04:17:29,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2023-12-16 04:17:29,448 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2023-12-16 04:17:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-16 04:17:29,449 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:17:29,449 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:17:29,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 04:17:29,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-12-16 04:17:29,656 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:17:29,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:17:29,657 INFO L85 PathProgramCache]: Analyzing trace with hash -5016176, now seen corresponding path program 1 times [2023-12-16 04:17:29,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:17:29,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758736648] [2023-12-16 04:17:29,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:17:29,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:17:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:17:29,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 04:17:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:17:29,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 04:17:29,749 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 04:17:29,751 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:17:29,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 04:17:29,758 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:17:29,762 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:17:29,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:17:29 BoogieIcfgContainer [2023-12-16 04:17:29,837 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:17:29,837 INFO L158 Benchmark]: Toolchain (without parser) took 14763.46ms. Allocated memory was 178.3MB in the beginning and 320.9MB in the end (delta: 142.6MB). Free memory was 129.0MB in the beginning and 216.3MB in the end (delta: -87.2MB). Peak memory consumption was 56.1MB. Max. memory is 8.0GB. [2023-12-16 04:17:29,838 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 178.3MB. Free memory is still 132.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:17:29,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.43ms. Allocated memory is still 178.3MB. Free memory was 128.7MB in the beginning and 115.8MB in the end (delta: 12.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 04:17:29,838 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.06ms. Allocated memory is still 178.3MB. Free memory was 115.8MB in the beginning and 113.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 04:17:29,838 INFO L158 Benchmark]: Boogie Preprocessor took 70.66ms. Allocated memory is still 178.3MB. Free memory was 113.0MB in the beginning and 109.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 04:17:29,839 INFO L158 Benchmark]: RCFGBuilder took 533.10ms. Allocated memory is still 178.3MB. Free memory was 109.5MB in the beginning and 148.5MB in the end (delta: -39.1MB). Peak memory consumption was 27.8MB. Max. memory is 8.0GB. [2023-12-16 04:17:29,839 INFO L158 Benchmark]: TraceAbstraction took 13678.09ms. Allocated memory was 178.3MB in the beginning and 320.9MB in the end (delta: 142.6MB). Free memory was 148.1MB in the beginning and 216.3MB in the end (delta: -68.2MB). Peak memory consumption was 74.4MB. Max. memory is 8.0GB. [2023-12-16 04:17:29,840 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.16ms. Allocated memory is still 178.3MB. Free memory is still 132.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 391.43ms. Allocated memory is still 178.3MB. Free memory was 128.7MB in the beginning and 115.8MB in the end (delta: 12.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.06ms. Allocated memory is still 178.3MB. Free memory was 115.8MB in the beginning and 113.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 70.66ms. Allocated memory is still 178.3MB. Free memory was 113.0MB in the beginning and 109.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 533.10ms. Allocated memory is still 178.3MB. Free memory was 109.5MB in the beginning and 148.5MB in the end (delta: -39.1MB). Peak memory consumption was 27.8MB. Max. memory is 8.0GB. * TraceAbstraction took 13678.09ms. Allocated memory was 178.3MB in the beginning and 320.9MB in the end (delta: 142.6MB). Free memory was 148.1MB in the beginning and 216.3MB in the end (delta: -68.2MB). Peak memory consumption was 74.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of bitwise operation at line 85, overapproximation of someBinaryArithmeticDOUBLEoperation at line 57. 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] double var_1_8 = 8.3; [L28] double var_1_9 = 255.6; [L29] double var_1_10 = 10000000.375; [L30] double var_1_11 = 0.0; [L31] double var_1_12 = 255.375; [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; [L89] isInitial = 1 [L90] FCALL initially() [L91] COND TRUE 1 [L92] FCALL updateLastVariables() [L93] 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=80000003/8, var_1_11=0, var_1_12=2043/8, 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=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, 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=83/10, var_1_9=1278/5] [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, 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=83/10, var_1_9=1278/5] [L63] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, 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=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, 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=83/10, var_1_9=1278/5] [L63] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, 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=83/10, var_1_9=1278/5] [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=80000003/8, var_1_11=0, var_1_12=2043/8, 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=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, 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=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L65] RET assume_abort_if_not(var_1_4 >= 16383) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, 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=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L66] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, 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=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, 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=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L66] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, 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=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L67] var_1_9 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, 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=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, 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=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L68] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, 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=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L69] var_1_10 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=2043/8, 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=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=0, var_1_12=2043/8, 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=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L70] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=0, var_1_12=2043/8, 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=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L71] var_1_11 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=2043/8, 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=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_12=2043/8, 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=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L72] RET assume_abort_if_not((var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=2043/8, 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=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L73] var_1_12 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, 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=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, 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=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L74] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, 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=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L75] var_1_14 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L76] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L77] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, 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=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, 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=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L77] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, 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=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L78] var_1_16 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L79] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L80] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L80] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L93] RET updateVariables() [L94] CALL step() [L39] var_1_13 = var_1_14 [L40] var_1_15 = var_1_16 VAL [isInitial=1, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [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_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L44] COND FALSE !(var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) VAL [isInitial=1, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L47] unsigned short int stepLocal_0 = var_1_4; [L48] EXPR var_1_13 << var_1_13 VAL [isInitial=1, stepLocal_0=29916, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [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=29916, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10] [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=29916, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=29916, var_1_6=25, var_1_7=76800, var_1_8=83/10] [L53] unsigned char stepLocal_1 = var_1_13; VAL [isInitial=1, stepLocal_0=29916, stepLocal_1=254, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=29916, var_1_6=25, var_1_7=76800, var_1_8=83/10] [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=29916, stepLocal_1=254, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=29916, var_1_6=25, var_1_7=76800] [L94] RET step() [L95] CALL, EXPR property() [L85] 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))))) [L85] EXPR var_1_13 << var_1_13 VAL [isInitial=1, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=29916, var_1_6=25, var_1_7=76800] [L85] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=29916, var_1_6=25, var_1_7=76800] [L85] 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_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=29916, var_1_6=25, var_1_7=76800] [L85-L86] 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 == ((double) (var_1_9 - var_1_10))) : (var_1_8 == ((double) ((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)) ; [L95] RET, EXPR property() [L95] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=29916, var_1_6=25, var_1_7=76800] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=29916, var_1_6=25, var_1_7=76800] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.5s, OverallIterations: 10, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 329 mSDsluCounter, 1242 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 786 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 873 IncrementalHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 456 mSDtfsCounter, 873 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 577 GetRequests, 511 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=4, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 77 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 994 NumberOfCodeBlocks, 994 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 982 ConstructedInterpolants, 0 QuantifiedInterpolants, 4425 SizeOfPredicates, 10 NumberOfNonLiveVariables, 423 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 3036/3168 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-16 04:17:29,873 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...