/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-76.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:28:35,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:28:35,173 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 21:28:35,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:28:35,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:28:35,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:28:35,187 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:28:35,188 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:28:35,188 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:28:35,188 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:28:35,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:28:35,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:28:35,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:28:35,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:28:35,190 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:28:35,190 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:28:35,190 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:28:35,190 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:28:35,191 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:28:35,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:28:35,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:28:35,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:28:35,192 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:28:35,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:28:35,192 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:28:35,192 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:28:35,193 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:28:35,193 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:28:35,193 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:28:35,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:28:35,193 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:28:35,194 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:28:35,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:28:35,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:28:35,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:28:35,195 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:28:35,195 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:28:35,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:28:35,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:28:35,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:28:35,196 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:28:35,196 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:28:35,196 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:28:35,196 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 21:28:35,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:28:35,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:28:35,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:28:35,353 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:28:35,353 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:28:35,354 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-76.i [2023-12-15 21:28:36,437 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:28:36,633 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:28:36,634 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-76.i [2023-12-15 21:28:36,641 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b570ec65a/255cafacade046a09296c33f344c7b4a/FLAG25244039d [2023-12-15 21:28:36,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b570ec65a/255cafacade046a09296c33f344c7b4a [2023-12-15 21:28:36,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:28:36,658 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:28:36,660 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:28:36,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:28:36,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:28:36,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:28:36" (1/1) ... [2023-12-15 21:28:36,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a8a033e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:36, skipping insertion in model container [2023-12-15 21:28:36,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:28:36" (1/1) ... [2023-12-15 21:28:36,690 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:28:36,803 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-76.i[913,926] [2023-12-15 21:28:36,847 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:28:36,855 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:28:36,862 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-76.i[913,926] [2023-12-15 21:28:36,883 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:28:36,895 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:28:36,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:36 WrapperNode [2023-12-15 21:28:36,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:28:36,896 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:28:36,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:28:36,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:28:36,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:36" (1/1) ... [2023-12-15 21:28:36,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:36" (1/1) ... [2023-12-15 21:28:36,925 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2023-12-15 21:28:36,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:28:36,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:28:36,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:28:36,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:28:36,938 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:36" (1/1) ... [2023-12-15 21:28:36,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:36" (1/1) ... [2023-12-15 21:28:36,940 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:36" (1/1) ... [2023-12-15 21:28:36,948 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 21:28:36,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:36" (1/1) ... [2023-12-15 21:28:36,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:36" (1/1) ... [2023-12-15 21:28:36,962 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:36" (1/1) ... [2023-12-15 21:28:36,965 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:36" (1/1) ... [2023-12-15 21:28:36,966 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:36" (1/1) ... [2023-12-15 21:28:36,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:36" (1/1) ... [2023-12-15 21:28:36,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:28:36,974 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:28:36,974 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:28:36,975 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:28:36,975 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:36" (1/1) ... [2023-12-15 21:28:36,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:28:36,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:28:37,030 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 21:28:37,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 21:28:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:28:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:28:37,080 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:28:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:28:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:28:37,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:28:37,155 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:28:37,156 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:28:37,305 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:28:37,334 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:28:37,334 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:28:37,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:28:37 BoogieIcfgContainer [2023-12-15 21:28:37,335 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:28:37,336 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:28:37,336 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:28:37,338 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:28:37,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:28:36" (1/3) ... [2023-12-15 21:28:37,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ee061a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:28:37, skipping insertion in model container [2023-12-15 21:28:37,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:36" (2/3) ... [2023-12-15 21:28:37,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ee061a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:28:37, skipping insertion in model container [2023-12-15 21:28:37,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:28:37" (3/3) ... [2023-12-15 21:28:37,340 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-76.i [2023-12-15 21:28:37,352 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:28:37,352 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:28:37,381 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:28:37,385 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;@8fe6f9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:28:37,385 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:28:37,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 28 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 21:28:37,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-15 21:28:37,395 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:28:37,395 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:28:37,396 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:28:37,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:28:37,399 INFO L85 PathProgramCache]: Analyzing trace with hash 726093493, now seen corresponding path program 1 times [2023-12-15 21:28:37,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:28:37,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666134686] [2023-12-15 21:28:37,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:28:37,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:28:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:37,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:28:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:37,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:28:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:37,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:28:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:37,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:28:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:37,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:28:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:37,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:28:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:37,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:28:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:37,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:28:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:37,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:28:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:37,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-15 21:28:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:37,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:28:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:37,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 21:28:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:37,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:28:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:37,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:28:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:37,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 21:28:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:37,751 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:28:37,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:28:37,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666134686] [2023-12-15 21:28:37,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666134686] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:28:37,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:28:37,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:28:37,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309773481] [2023-12-15 21:28:37,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:28:37,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:28:37,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:28:37,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:28:37,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:28:37,788 INFO L87 Difference]: Start difference. First operand has 45 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 28 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:28:37,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:28:37,835 INFO L93 Difference]: Finished difference Result 87 states and 153 transitions. [2023-12-15 21:28:37,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:28:37,846 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 93 [2023-12-15 21:28:37,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:28:37,851 INFO L225 Difference]: With dead ends: 87 [2023-12-15 21:28:37,851 INFO L226 Difference]: Without dead ends: 43 [2023-12-15 21:28:37,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:28:37,855 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:28:37,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:28:37,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-15 21:28:37,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-12-15 21:28:37,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 21:28:37,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2023-12-15 21:28:37,897 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 93 [2023-12-15 21:28:37,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:28:37,899 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2023-12-15 21:28:37,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:28:37,899 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2023-12-15 21:28:37,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-15 21:28:37,902 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:28:37,903 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:28:37,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:28:37,903 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:28:37,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:28:37,904 INFO L85 PathProgramCache]: Analyzing trace with hash 499233082, now seen corresponding path program 1 times [2023-12-15 21:28:37,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:28:37,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101470262] [2023-12-15 21:28:37,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:28:37,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:28:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:28:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:28:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:28:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:28:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:28:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:28:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:28:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:28:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:28:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-15 21:28:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:28:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 21:28:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:28:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:28:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 21:28:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,086 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:28:38,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:28:38,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101470262] [2023-12-15 21:28:38,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101470262] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:28:38,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:28:38,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:28:38,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852290062] [2023-12-15 21:28:38,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:28:38,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:28:38,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:28:38,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:28:38,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:28:38,097 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:28:38,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:28:38,136 INFO L93 Difference]: Finished difference Result 85 states and 127 transitions. [2023-12-15 21:28:38,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:28:38,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2023-12-15 21:28:38,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:28:38,138 INFO L225 Difference]: With dead ends: 85 [2023-12-15 21:28:38,139 INFO L226 Difference]: Without dead ends: 43 [2023-12-15 21:28:38,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-15 21:28:38,140 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 15 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:28:38,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 103 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:28:38,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-15 21:28:38,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-12-15 21:28:38,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 21:28:38,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2023-12-15 21:28:38,146 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 94 [2023-12-15 21:28:38,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:28:38,146 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 63 transitions. [2023-12-15 21:28:38,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:28:38,147 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2023-12-15 21:28:38,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-15 21:28:38,148 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:28:38,148 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:28:38,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:28:38,148 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:28:38,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:28:38,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1179291452, now seen corresponding path program 1 times [2023-12-15 21:28:38,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:28:38,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542321676] [2023-12-15 21:28:38,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:28:38,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:28:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:28:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:28:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:28:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:28:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:28:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:28:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:28:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:28:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:28:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-15 21:28:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:28:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 21:28:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:28:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:28:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 21:28:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:28:38,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:28:38,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542321676] [2023-12-15 21:28:38,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542321676] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:28:38,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:28:38,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:28:38,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851411005] [2023-12-15 21:28:38,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:28:38,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:28:38,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:28:38,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:28:38,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:28:38,270 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:28:38,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:28:38,298 INFO L93 Difference]: Finished difference Result 85 states and 125 transitions. [2023-12-15 21:28:38,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:28:38,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2023-12-15 21:28:38,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:28:38,300 INFO L225 Difference]: With dead ends: 85 [2023-12-15 21:28:38,300 INFO L226 Difference]: Without dead ends: 43 [2023-12-15 21:28:38,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-15 21:28:38,313 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 7 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:28:38,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 106 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:28:38,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-15 21:28:38,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-12-15 21:28:38,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 21:28:38,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 62 transitions. [2023-12-15 21:28:38,340 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 62 transitions. Word has length 94 [2023-12-15 21:28:38,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:28:38,340 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 62 transitions. [2023-12-15 21:28:38,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:28:38,340 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 62 transitions. [2023-12-15 21:28:38,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-15 21:28:38,341 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:28:38,341 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:28:38,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:28:38,342 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:28:38,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:28:38,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1951682934, now seen corresponding path program 1 times [2023-12-15 21:28:38,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:28:38,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706050630] [2023-12-15 21:28:38,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:28:38,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:28:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:28:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:28:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:28:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:28:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:28:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:28:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:28:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:28:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:28:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-15 21:28:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:28:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 21:28:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:28:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:28:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 21:28:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:38,452 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:28:38,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:28:38,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706050630] [2023-12-15 21:28:38,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706050630] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:28:38,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:28:38,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:28:38,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922985087] [2023-12-15 21:28:38,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:28:38,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:28:38,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:28:38,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:28:38,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:28:38,454 INFO L87 Difference]: Start difference. First operand 43 states and 62 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:28:38,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:28:38,499 INFO L93 Difference]: Finished difference Result 123 states and 177 transitions. [2023-12-15 21:28:38,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:28:38,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2023-12-15 21:28:38,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:28:38,502 INFO L225 Difference]: With dead ends: 123 [2023-12-15 21:28:38,503 INFO L226 Difference]: Without dead ends: 81 [2023-12-15 21:28:38,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-15 21:28:38,511 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 52 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:28:38,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 114 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:28:38,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-15 21:28:38,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 47. [2023-12-15 21:28:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 21:28:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2023-12-15 21:28:38,517 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 95 [2023-12-15 21:28:38,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:28:38,517 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2023-12-15 21:28:38,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:28:38,517 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2023-12-15 21:28:38,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-15 21:28:38,518 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:28:38,518 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:28:38,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:28:38,519 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:28:38,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:28:38,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1953529976, now seen corresponding path program 1 times [2023-12-15 21:28:38,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:28:38,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721294427] [2023-12-15 21:28:38,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:28:38,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:28:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:39,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:28:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:39,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:28:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:39,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:28:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:39,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:28:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:39,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:28:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:39,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:28:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:39,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:28:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:39,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:28:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:39,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:28:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:39,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-15 21:28:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:39,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:28:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:39,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 21:28:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:39,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:28:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:39,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:28:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:39,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 21:28:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:39,798 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:28:39,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:28:39,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721294427] [2023-12-15 21:28:39,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721294427] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:28:39,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:28:39,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:28:39,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067741626] [2023-12-15 21:28:39,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:28:39,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:28:39,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:28:39,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:28:39,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:28:39,800 INFO L87 Difference]: Start difference. First operand 47 states and 66 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:28:40,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:28:40,073 INFO L93 Difference]: Finished difference Result 135 states and 179 transitions. [2023-12-15 21:28:40,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:28:40,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2023-12-15 21:28:40,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:28:40,074 INFO L225 Difference]: With dead ends: 135 [2023-12-15 21:28:40,074 INFO L226 Difference]: Without dead ends: 89 [2023-12-15 21:28:40,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:28:40,075 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 66 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:28:40,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 245 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:28:40,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-15 21:28:40,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 66. [2023-12-15 21:28:40,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-15 21:28:40,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2023-12-15 21:28:40,083 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 95 [2023-12-15 21:28:40,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:28:40,084 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2023-12-15 21:28:40,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:28:40,084 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2023-12-15 21:28:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-15 21:28:40,094 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:28:40,094 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:28:40,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:28:40,094 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:28:40,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:28:40,095 INFO L85 PathProgramCache]: Analyzing trace with hash 363211042, now seen corresponding path program 1 times [2023-12-15 21:28:40,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:28:40,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422513831] [2023-12-15 21:28:40,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:28:40,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:28:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:40,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:28:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:40,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:28:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:40,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:28:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:40,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:28:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:40,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:28:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:40,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:28:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:40,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:28:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:40,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:28:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:40,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:28:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:40,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-15 21:28:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:40,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:28:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:40,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 21:28:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:40,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:28:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:40,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:28:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:40,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 21:28:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:40,254 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-15 21:28:40,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:28:40,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422513831] [2023-12-15 21:28:40,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422513831] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:28:40,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387272819] [2023-12-15 21:28:40,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:28:40,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:28:40,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:28:40,270 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-15 21:28:40,291 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-15 21:28:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:40,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-15 21:28:40,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:28:40,475 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 204 proven. 27 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2023-12-15 21:28:40,475 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:28:40,593 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-15 21:28:40,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387272819] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:28:40,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:28:40,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2023-12-15 21:28:40,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351769373] [2023-12-15 21:28:40,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:28:40,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:28:40,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:28:40,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:28:40,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:28:40,595 INFO L87 Difference]: Start difference. First operand 66 states and 86 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-15 21:28:40,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:28:40,838 INFO L93 Difference]: Finished difference Result 153 states and 196 transitions. [2023-12-15 21:28:40,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-15 21:28:40,838 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 96 [2023-12-15 21:28:40,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:28:40,838 INFO L225 Difference]: With dead ends: 153 [2023-12-15 21:28:40,838 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 21:28:40,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 217 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2023-12-15 21:28:40,839 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 69 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:28:40,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 127 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:28:40,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 21:28:40,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 21:28:40,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:28:40,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 21:28:40,840 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 96 [2023-12-15 21:28:40,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:28:40,840 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 21:28:40,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-15 21:28:40,841 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 21:28:40,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 21:28:40,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:28:40,850 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-15 21:28:41,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-15 21:28:41,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 21:28:41,115 INFO L895 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-15 21:28:41,116 INFO L895 garLoopResultBuilder]: At program point L93-1(line 93) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-15 21:28:41,116 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2023-12-15 21:28:41,116 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-15 21:28:41,116 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-15 21:28:41,116 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-15 21:28:41,116 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-12-15 21:28:41,116 INFO L899 garLoopResultBuilder]: For program point L94(lines 71 95) no Hoare annotation was computed. [2023-12-15 21:28:41,116 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 70) no Hoare annotation was computed. [2023-12-15 21:28:41,116 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 66) no Hoare annotation was computed. [2023-12-15 21:28:41,116 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-15 21:28:41,116 INFO L895 garLoopResultBuilder]: At program point L87-1(line 87) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-15 21:28:41,116 INFO L902 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: true [2023-12-15 21:28:41,116 INFO L902 garLoopResultBuilder]: At program point L79-1(line 79) the Hoare annotation is: true [2023-12-15 21:28:41,116 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 21:28:41,117 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2023-12-15 21:28:41,117 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-12-15 21:28:41,117 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 53) no Hoare annotation was computed. [2023-12-15 21:28:41,117 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-12-15 21:28:41,117 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 37 70) no Hoare annotation was computed. [2023-12-15 21:28:41,117 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 60) no Hoare annotation was computed. [2023-12-15 21:28:41,117 INFO L899 garLoopResultBuilder]: For program point L56-1(lines 37 70) no Hoare annotation was computed. [2023-12-15 21:28:41,117 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-15 21:28:41,117 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-15 21:28:41,117 INFO L895 garLoopResultBuilder]: At program point L106-2(lines 106 112) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-15 21:28:41,117 INFO L899 garLoopResultBuilder]: For program point L106-3(lines 106 112) no Hoare annotation was computed. [2023-12-15 21:28:41,118 INFO L895 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-15 21:28:41,118 INFO L895 garLoopResultBuilder]: At program point L90-1(line 90) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-15 21:28:41,118 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 59) no Hoare annotation was computed. [2023-12-15 21:28:41,118 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-15 21:28:41,118 INFO L895 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-15 21:28:41,118 INFO L899 garLoopResultBuilder]: For program point L82-1(line 82) no Hoare annotation was computed. [2023-12-15 21:28:41,118 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-12-15 21:28:41,118 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 21:28:41,118 INFO L899 garLoopResultBuilder]: For program point L91(line 91) no Hoare annotation was computed. [2023-12-15 21:28:41,118 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 52) no Hoare annotation was computed. [2023-12-15 21:28:41,118 INFO L899 garLoopResultBuilder]: For program point L50-2(lines 44 54) no Hoare annotation was computed. [2023-12-15 21:28:41,118 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-15 21:28:41,118 INFO L895 garLoopResultBuilder]: At program point L84-1(line 84) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-15 21:28:41,119 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-15 21:28:41,119 INFO L895 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-15 21:28:41,119 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-15 21:28:41,119 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-15 21:28:41,119 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-15 21:28:41,119 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-15 21:28:41,121 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-15 21:28:41,122 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:28:41,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:28:41 BoogieIcfgContainer [2023-12-15 21:28:41,129 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:28:41,130 INFO L158 Benchmark]: Toolchain (without parser) took 4471.38ms. Allocated memory was 255.9MB in the beginning and 307.2MB in the end (delta: 51.4MB). Free memory was 211.7MB in the beginning and 247.8MB in the end (delta: -36.1MB). Peak memory consumption was 14.8MB. Max. memory is 8.0GB. [2023-12-15 21:28:41,130 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 162.5MB. Free memory was 109.6MB in the beginning and 109.5MB in the end (delta: 138.1kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:28:41,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.02ms. Allocated memory is still 255.9MB. Free memory was 211.7MB in the beginning and 199.0MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 21:28:41,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.68ms. Allocated memory is still 255.9MB. Free memory was 199.0MB in the beginning and 197.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:28:41,130 INFO L158 Benchmark]: Boogie Preprocessor took 47.79ms. Allocated memory is still 255.9MB. Free memory was 197.0MB in the beginning and 193.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 21:28:41,131 INFO L158 Benchmark]: RCFGBuilder took 360.29ms. Allocated memory is still 255.9MB. Free memory was 193.9MB in the beginning and 176.0MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-15 21:28:41,131 INFO L158 Benchmark]: TraceAbstraction took 3793.42ms. Allocated memory was 255.9MB in the beginning and 307.2MB in the end (delta: 51.4MB). Free memory was 175.5MB in the beginning and 247.8MB in the end (delta: -72.3MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:28:41,132 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.09ms. Allocated memory is still 162.5MB. Free memory was 109.6MB in the beginning and 109.5MB in the end (delta: 138.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.02ms. Allocated memory is still 255.9MB. Free memory was 211.7MB in the beginning and 199.0MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.68ms. Allocated memory is still 255.9MB. Free memory was 199.0MB in the beginning and 197.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.79ms. Allocated memory is still 255.9MB. Free memory was 197.0MB in the beginning and 193.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 360.29ms. Allocated memory is still 255.9MB. Free memory was 193.9MB in the beginning and 176.0MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 3793.42ms. Allocated memory was 255.9MB in the beginning and 307.2MB in the end (delta: 51.4MB). Free memory was 175.5MB in the beginning and 247.8MB in the end (delta: -72.3MB). There was no memory consumed. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 6, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 215 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 209 mSDsluCounter, 756 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 396 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 369 IncrementalHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 360 mSDtfsCounter, 369 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 413 GetRequests, 380 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=5, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 57 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 136 PreInvPairs, 168 NumberOfFragments, 101 HoareAnnotationTreeSize, 136 FormulaSimplifications, 1017 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FormulaSimplificationsInter, 670 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 663 NumberOfCodeBlocks, 663 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 751 ConstructedInterpolants, 0 QuantifiedInterpolants, 1867 SizeOfPredicates, 4 NumberOfNonLiveVariables, 228 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 3279/3360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: (var_1_5 == ((var_1_5 / 256) * 256)) RESULT: Ultimate proved your program to be correct! [2023-12-15 21:28:41,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...