/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_loopvsstraightlinecode_25-1loop_file-13.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 20:52:40,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 20:52:40,921 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 20:52:40,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 20:52:40,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 20:52:40,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 20:52:40,954 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 20:52:40,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 20:52:40,955 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 20:52:40,959 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 20:52:40,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 20:52:40,959 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 20:52:40,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 20:52:40,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 20:52:40,961 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 20:52:40,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 20:52:40,961 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 20:52:40,962 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 20:52:40,962 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 20:52:40,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 20:52:40,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 20:52:40,963 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 20:52:40,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 20:52:40,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 20:52:40,964 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 20:52:40,964 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 20:52:40,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 20:52:40,965 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 20:52:40,965 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 20:52:40,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 20:52:40,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 20:52:40,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 20:52:40,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:52:40,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 20:52:40,967 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 20:52:40,967 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 20:52:40,967 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 20:52:40,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 20:52:40,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 20:52:40,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 20:52:40,967 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 20:52:40,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 20:52:40,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 20:52:40,968 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 20:52:41,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 20:52:41,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 20:52:41,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 20:52:41,220 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 20:52:41,220 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 20:52:41,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-13.i [2023-12-15 20:52:42,437 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 20:52:42,673 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 20:52:42,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-13.i [2023-12-15 20:52:42,683 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed8301e58/11f4d289060b4727bd857c021b77b581/FLAGd74087d27 [2023-12-15 20:52:43,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed8301e58/11f4d289060b4727bd857c021b77b581 [2023-12-15 20:52:43,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 20:52:43,019 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 20:52:43,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 20:52:43,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 20:52:43,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 20:52:43,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:52:43" (1/1) ... [2023-12-15 20:52:43,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17fa99fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:43, skipping insertion in model container [2023-12-15 20:52:43,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:52:43" (1/1) ... [2023-12-15 20:52:43,059 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 20:52:43,177 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_loopvsstraightlinecode_25-1loop_file-13.i[915,928] [2023-12-15 20:52:43,213 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:52:43,222 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 20:52:43,230 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_loopvsstraightlinecode_25-1loop_file-13.i[915,928] [2023-12-15 20:52:43,255 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:52:43,268 INFO L206 MainTranslator]: Completed translation [2023-12-15 20:52:43,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:43 WrapperNode [2023-12-15 20:52:43,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 20:52:43,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 20:52:43,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 20:52:43,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 20:52:43,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:43" (1/1) ... [2023-12-15 20:52:43,288 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:43" (1/1) ... [2023-12-15 20:52:43,326 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2023-12-15 20:52:43,326 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 20:52:43,327 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 20:52:43,327 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 20:52:43,327 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 20:52:43,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:43" (1/1) ... [2023-12-15 20:52:43,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:43" (1/1) ... [2023-12-15 20:52:43,346 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:43" (1/1) ... [2023-12-15 20:52:43,361 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 20:52:43,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:43" (1/1) ... [2023-12-15 20:52:43,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:43" (1/1) ... [2023-12-15 20:52:43,372 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:43" (1/1) ... [2023-12-15 20:52:43,374 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:43" (1/1) ... [2023-12-15 20:52:43,385 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:43" (1/1) ... [2023-12-15 20:52:43,387 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:43" (1/1) ... [2023-12-15 20:52:43,396 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 20:52:43,397 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 20:52:43,397 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 20:52:43,397 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 20:52:43,398 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:43" (1/1) ... [2023-12-15 20:52:43,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:52:43,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:52:43,434 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 20:52:43,455 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 20:52:43,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 20:52:43,463 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 20:52:43,463 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 20:52:43,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 20:52:43,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 20:52:43,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 20:52:43,548 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 20:52:43,550 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 20:52:43,780 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 20:52:43,850 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 20:52:43,851 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 20:52:43,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:52:43 BoogieIcfgContainer [2023-12-15 20:52:43,851 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 20:52:43,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 20:52:43,853 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 20:52:43,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 20:52:43,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:52:43" (1/3) ... [2023-12-15 20:52:43,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41839714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:52:43, skipping insertion in model container [2023-12-15 20:52:43,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:43" (2/3) ... [2023-12-15 20:52:43,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41839714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:52:43, skipping insertion in model container [2023-12-15 20:52:43,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:52:43" (3/3) ... [2023-12-15 20:52:43,859 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-13.i [2023-12-15 20:52:43,874 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 20:52:43,874 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 20:52:43,923 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 20:52:43,931 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;@7ef5f52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 20:52:43,931 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 20:52:43,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 20:52:43,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-15 20:52:43,943 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:52:43,944 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:52:43,944 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:52:43,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:52:43,962 INFO L85 PathProgramCache]: Analyzing trace with hash 379498785, now seen corresponding path program 1 times [2023-12-15 20:52:43,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:52:43,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350817317] [2023-12-15 20:52:43,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:52:43,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:52:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:52:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:52:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:52:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:52:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:52:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:52:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:52:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:52:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:52:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:52:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:52:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:52:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:52:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:52:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:52:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:52:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,322 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:52:44,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:52:44,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350817317] [2023-12-15 20:52:44,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350817317] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:52:44,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:52:44,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 20:52:44,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927652990] [2023-12-15 20:52:44,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:52:44,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 20:52:44,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:52:44,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 20:52:44,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:52:44,363 INFO L87 Difference]: Start difference. First operand has 40 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 20:52:44,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:52:44,410 INFO L93 Difference]: Finished difference Result 79 states and 137 transitions. [2023-12-15 20:52:44,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 20:52:44,412 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 96 [2023-12-15 20:52:44,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:52:44,419 INFO L225 Difference]: With dead ends: 79 [2023-12-15 20:52:44,419 INFO L226 Difference]: Without dead ends: 38 [2023-12-15 20:52:44,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:52:44,426 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:52:44,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:52:44,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-15 20:52:44,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-15 20:52:44,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 20:52:44,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2023-12-15 20:52:44,471 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 96 [2023-12-15 20:52:44,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:52:44,471 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2023-12-15 20:52:44,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 20:52:44,472 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2023-12-15 20:52:44,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-15 20:52:44,482 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:52:44,482 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:52:44,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 20:52:44,482 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:52:44,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:52:44,485 INFO L85 PathProgramCache]: Analyzing trace with hash -923545311, now seen corresponding path program 1 times [2023-12-15 20:52:44,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:52:44,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054173635] [2023-12-15 20:52:44,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:52:44,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:52:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:52:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:52:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:52:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:52:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:52:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:52:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:52:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:52:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:52:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:52:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:52:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:52:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:52:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:52:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:52:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:52:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,683 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:52:44,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:52:44,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054173635] [2023-12-15 20:52:44,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054173635] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:52:44,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:52:44,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:52:44,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230493249] [2023-12-15 20:52:44,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:52:44,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:52:44,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:52:44,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:52:44,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:52:44,701 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:52:44,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:52:44,742 INFO L93 Difference]: Finished difference Result 104 states and 155 transitions. [2023-12-15 20:52:44,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:52:44,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 96 [2023-12-15 20:52:44,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:52:44,749 INFO L225 Difference]: With dead ends: 104 [2023-12-15 20:52:44,749 INFO L226 Difference]: Without dead ends: 67 [2023-12-15 20:52:44,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:52:44,751 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 51 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:52:44,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 133 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:52:44,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-15 20:52:44,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 38. [2023-12-15 20:52:44,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 20:52:44,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 54 transitions. [2023-12-15 20:52:44,768 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 54 transitions. Word has length 96 [2023-12-15 20:52:44,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:52:44,770 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 54 transitions. [2023-12-15 20:52:44,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:52:44,771 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 54 transitions. [2023-12-15 20:52:44,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-15 20:52:44,774 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:52:44,774 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:52:44,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 20:52:44,774 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:52:44,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:52:44,775 INFO L85 PathProgramCache]: Analyzing trace with hash -921698269, now seen corresponding path program 1 times [2023-12-15 20:52:44,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:52:44,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114501335] [2023-12-15 20:52:44,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:52:44,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:52:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:52:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:52:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:52:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:52:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:52:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:52:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:44,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:52:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:45,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:52:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:45,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:52:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:45,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:52:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:45,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:52:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:45,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:52:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:45,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:52:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:45,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:52:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:45,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:52:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:45,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:52:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:52:45,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:52:45,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114501335] [2023-12-15 20:52:45,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114501335] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:52:45,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:52:45,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:52:45,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399711742] [2023-12-15 20:52:45,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:52:45,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:52:45,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:52:45,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:52:45,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:52:45,070 INFO L87 Difference]: Start difference. First operand 38 states and 54 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:52:45,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:52:45,098 INFO L93 Difference]: Finished difference Result 75 states and 107 transitions. [2023-12-15 20:52:45,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:52:45,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 96 [2023-12-15 20:52:45,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:52:45,102 INFO L225 Difference]: With dead ends: 75 [2023-12-15 20:52:45,102 INFO L226 Difference]: Without dead ends: 38 [2023-12-15 20:52:45,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:52:45,107 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:52:45,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 48 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:52:45,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-15 20:52:45,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-15 20:52:45,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 20:52:45,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2023-12-15 20:52:45,117 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 96 [2023-12-15 20:52:45,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:52:45,117 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2023-12-15 20:52:45,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:52:45,117 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2023-12-15 20:52:45,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-15 20:52:45,119 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:52:45,119 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:52:45,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 20:52:45,119 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:52:45,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:52:45,120 INFO L85 PathProgramCache]: Analyzing trace with hash -921638687, now seen corresponding path program 1 times [2023-12-15 20:52:45,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:52:45,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875509182] [2023-12-15 20:52:45,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:52:45,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:52:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:52:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:52:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:52:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:52:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:52:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:52:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:52:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:52:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:52:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:52:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:52:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:52:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:52:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:52:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:52:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:52:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,226 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:52:49,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:52:49,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875509182] [2023-12-15 20:52:49,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875509182] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:52:49,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:52:49,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 20:52:49,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126952380] [2023-12-15 20:52:49,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:52:49,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 20:52:49,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:52:49,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 20:52:49,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-15 20:52:49,228 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:52:49,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:52:49,424 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2023-12-15 20:52:49,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 20:52:49,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 96 [2023-12-15 20:52:49,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:52:49,426 INFO L225 Difference]: With dead ends: 62 [2023-12-15 20:52:49,426 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 20:52:49,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:52:49,431 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 35 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:52:49,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 265 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:52:49,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 20:52:49,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 20:52:49,432 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 20:52:49,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 20:52:49,433 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 96 [2023-12-15 20:52:49,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:52:49,433 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 20:52:49,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:52:49,433 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 20:52:49,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 20:52:49,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 20:52:49,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 20:52:49,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 20:52:49,638 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-12-15 20:52:49,639 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-15 20:52:49,640 INFO L895 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-15 20:52:49,640 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-15 20:52:49,640 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-15 20:52:49,640 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-15 20:52:49,640 INFO L895 garLoopResultBuilder]: At program point L81-1(line 81) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-15 20:52:49,640 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-15 20:52:49,640 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 40 57) no Hoare annotation was computed. [2023-12-15 20:52:49,640 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-12-15 20:52:49,641 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-15 20:52:49,641 INFO L895 garLoopResultBuilder]: At program point L69-1(line 69) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-15 20:52:49,642 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2023-12-15 20:52:49,642 INFO L895 garLoopResultBuilder]: At program point L94-3(lines 94 100) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-15 20:52:49,642 INFO L899 garLoopResultBuilder]: For program point L94-4(lines 94 100) no Hoare annotation was computed. [2023-12-15 20:52:49,642 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-15 20:52:49,642 INFO L899 garLoopResultBuilder]: For program point L82(lines 58 83) no Hoare annotation was computed. [2023-12-15 20:52:49,642 INFO L895 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-15 20:52:49,642 INFO L895 garLoopResultBuilder]: At program point L78-1(line 78) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-15 20:52:49,642 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-12-15 20:52:49,642 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-15 20:52:49,642 INFO L895 garLoopResultBuilder]: At program point L66-1(line 66) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-15 20:52:49,643 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 20:52:49,643 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-12-15 20:52:49,643 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-15 20:52:49,643 INFO L895 garLoopResultBuilder]: At program point L75-1(line 75) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-15 20:52:49,643 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 20:52:49,643 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-12-15 20:52:49,643 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-15 20:52:49,643 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-15 20:52:49,643 INFO L899 garLoopResultBuilder]: For program point L51-1(lines 51 53) no Hoare annotation was computed. [2023-12-15 20:52:49,643 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-12-15 20:52:49,643 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2023-12-15 20:52:49,644 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 40 57) no Hoare annotation was computed. [2023-12-15 20:52:49,644 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-15 20:52:49,644 INFO L895 garLoopResultBuilder]: At program point L72-1(line 72) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-15 20:52:49,644 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-15 20:52:49,644 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-15 20:52:49,644 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-15 20:52:49,645 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-15 20:52:49,647 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-15 20:52:49,649 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 20:52:49,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:52:49 BoogieIcfgContainer [2023-12-15 20:52:49,659 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 20:52:49,659 INFO L158 Benchmark]: Toolchain (without parser) took 6640.19ms. Allocated memory was 269.5MB in the beginning and 389.0MB in the end (delta: 119.5MB). Free memory was 219.1MB in the beginning and 204.5MB in the end (delta: 14.7MB). Peak memory consumption was 135.3MB. Max. memory is 8.0GB. [2023-12-15 20:52:49,659 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 188.7MB. Free memory is still 140.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:52:49,660 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.22ms. Allocated memory is still 269.5MB. Free memory was 218.8MB in the beginning and 205.8MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 20:52:49,660 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.60ms. Allocated memory is still 269.5MB. Free memory was 205.8MB in the beginning and 202.0MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 20:52:49,660 INFO L158 Benchmark]: Boogie Preprocessor took 69.39ms. Allocated memory is still 269.5MB. Free memory was 202.0MB in the beginning and 195.0MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-15 20:52:49,660 INFO L158 Benchmark]: RCFGBuilder took 454.31ms. Allocated memory is still 269.5MB. Free memory was 195.0MB in the beginning and 173.0MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-15 20:52:49,661 INFO L158 Benchmark]: TraceAbstraction took 5805.96ms. Allocated memory was 269.5MB in the beginning and 389.0MB in the end (delta: 119.5MB). Free memory was 172.3MB in the beginning and 204.5MB in the end (delta: -32.1MB). Peak memory consumption was 88.1MB. Max. memory is 8.0GB. [2023-12-15 20:52:49,663 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.54ms. Allocated memory is still 188.7MB. Free memory is still 140.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.22ms. Allocated memory is still 269.5MB. Free memory was 218.8MB in the beginning and 205.8MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.60ms. Allocated memory is still 269.5MB. Free memory was 205.8MB in the beginning and 202.0MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 69.39ms. Allocated memory is still 269.5MB. Free memory was 202.0MB in the beginning and 195.0MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 454.31ms. Allocated memory is still 269.5MB. Free memory was 195.0MB in the beginning and 173.0MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 5805.96ms. Allocated memory was 269.5MB in the beginning and 389.0MB in the end (delta: 119.5MB). Free memory was 172.3MB in the beginning and 204.5MB in the end (delta: -32.1MB). Peak memory consumption was 88.1MB. 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, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 4, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 499 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 234 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 97 IncrementalHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 265 mSDtfsCounter, 97 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 14, 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, 4 MinimizatonAttempts, 29 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 91 PreInvPairs, 119 NumberOfFragments, 154 HoareAnnotationTreeSize, 91 FormulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FormulaSimplificationsInter, 627 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 774 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1920/1920 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: 94]: Loop Invariant Derived loop invariant: ((25 <= var_1_1) && ((var_1_1 / 65536) <= 0)) RESULT: Ultimate proved your program to be correct! [2023-12-15 20:52:49,687 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...