/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-13.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 03:46:10,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 03:46:10,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 03:46:10,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 03:46:10,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 03:46:10,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 03:46:10,231 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 03:46:10,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 03:46:10,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 03:46:10,235 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 03:46:10,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 03:46:10,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 03:46:10,235 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 03:46:10,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 03:46:10,237 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 03:46:10,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 03:46:10,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 03:46:10,237 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 03:46:10,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 03:46:10,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 03:46:10,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 03:46:10,238 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 03:46:10,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 03:46:10,238 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 03:46:10,238 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 03:46:10,238 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 03:46:10,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 03:46:10,239 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 03:46:10,239 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 03:46:10,239 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 03:46:10,240 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 03:46:10,240 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 03:46:10,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:46:10,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 03:46:10,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 03:46:10,241 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 03:46:10,241 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 03:46:10,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 03:46:10,241 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 03:46:10,241 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 03:46:10,241 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 03:46:10,242 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 03:46:10,242 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 03:46:10,242 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 03:46:10,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 03:46:10,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 03:46:10,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 03:46:10,459 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 03:46:10,460 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 03:46:10,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-13.i [2023-12-16 03:46:11,596 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 03:46:11,774 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 03:46:11,775 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-13.i [2023-12-16 03:46:11,783 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f31b1586/7231405ce6824a6aa97bb573dd286c87/FLAG628e9d099 [2023-12-16 03:46:11,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f31b1586/7231405ce6824a6aa97bb573dd286c87 [2023-12-16 03:46:11,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 03:46:11,795 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 03:46:11,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 03:46:11,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 03:46:11,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 03:46:11,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:46:11" (1/1) ... [2023-12-16 03:46:11,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77ebc4b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:11, skipping insertion in model container [2023-12-16 03:46:11,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:46:11" (1/1) ... [2023-12-16 03:46:11,823 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 03:46:11,917 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-while_file-13.i[915,928] [2023-12-16 03:46:11,984 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:46:12,004 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 03:46:12,028 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-while_file-13.i[915,928] [2023-12-16 03:46:12,042 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:46:12,066 INFO L206 MainTranslator]: Completed translation [2023-12-16 03:46:12,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:12 WrapperNode [2023-12-16 03:46:12,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 03:46:12,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 03:46:12,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 03:46:12,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 03:46:12,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:12" (1/1) ... [2023-12-16 03:46:12,089 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:12" (1/1) ... [2023-12-16 03:46:12,138 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2023-12-16 03:46:12,138 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 03:46:12,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 03:46:12,139 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 03:46:12,139 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 03:46:12,146 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:12" (1/1) ... [2023-12-16 03:46:12,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:12" (1/1) ... [2023-12-16 03:46:12,149 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:12" (1/1) ... [2023-12-16 03:46:12,160 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 03:46:12,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:12" (1/1) ... [2023-12-16 03:46:12,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:12" (1/1) ... [2023-12-16 03:46:12,164 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:12" (1/1) ... [2023-12-16 03:46:12,166 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:12" (1/1) ... [2023-12-16 03:46:12,167 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:12" (1/1) ... [2023-12-16 03:46:12,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:12" (1/1) ... [2023-12-16 03:46:12,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 03:46:12,171 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 03:46:12,171 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 03:46:12,171 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 03:46:12,172 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:12" (1/1) ... [2023-12-16 03:46:12,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:46:12,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:46:12,221 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 03:46:12,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 03:46:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 03:46:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 03:46:12,275 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 03:46:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 03:46:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 03:46:12,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 03:46:12,330 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 03:46:12,331 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 03:46:12,681 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 03:46:12,735 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 03:46:12,736 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 03:46:12,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:46:12 BoogieIcfgContainer [2023-12-16 03:46:12,736 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 03:46:12,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 03:46:12,738 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 03:46:12,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 03:46:12,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:46:11" (1/3) ... [2023-12-16 03:46:12,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0e3cde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:46:12, skipping insertion in model container [2023-12-16 03:46:12,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:12" (2/3) ... [2023-12-16 03:46:12,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0e3cde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:46:12, skipping insertion in model container [2023-12-16 03:46:12,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:46:12" (3/3) ... [2023-12-16 03:46:12,741 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-13.i [2023-12-16 03:46:12,752 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 03:46:12,752 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 03:46:12,791 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 03:46:12,799 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;@5e217ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 03:46:12,799 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 03:46:12,802 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-16 03:46:12,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-16 03:46:12,811 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:12,811 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-16 03:46:12,811 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:12,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:12,815 INFO L85 PathProgramCache]: Analyzing trace with hash 933376894, now seen corresponding path program 1 times [2023-12-16 03:46:12,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:12,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944289532] [2023-12-16 03:46:12,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:12,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:12,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:12,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:46:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:12,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:12,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:46:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:12,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:12,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:46:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:12,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:46:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:12,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:46:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:12,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:46:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:12,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:46:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:12,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:46:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:12,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:46:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:46:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:46:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:46:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:46:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 03:46:13,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:13,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944289532] [2023-12-16 03:46:13,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944289532] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:46:13,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:46:13,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 03:46:13,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733018114] [2023-12-16 03:46:13,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:46:13,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 03:46:13,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:13,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 03:46:13,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:46:13,067 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-16 03:46:13,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:46:13,105 INFO L93 Difference]: Finished difference Result 77 states and 136 transitions. [2023-12-16 03:46:13,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 03:46:13,108 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-16 03:46:13,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:46:13,113 INFO L225 Difference]: With dead ends: 77 [2023-12-16 03:46:13,114 INFO L226 Difference]: Without dead ends: 38 [2023-12-16 03:46:13,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:46:13,120 INFO L413 NwaCegarLoop]: 53 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, 53 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:46:13,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:46:13,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-16 03:46:13,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-16 03:46:13,149 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-16 03:46:13,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2023-12-16 03:46:13,153 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 96 [2023-12-16 03:46:13,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:46:13,154 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2023-12-16 03:46:13,154 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-16 03:46:13,154 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2023-12-16 03:46:13,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-16 03:46:13,157 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:13,157 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-16 03:46:13,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 03:46:13,157 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:13,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:13,158 INFO L85 PathProgramCache]: Analyzing trace with hash -369667202, now seen corresponding path program 1 times [2023-12-16 03:46:13,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:13,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813595292] [2023-12-16 03:46:13,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:13,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:46:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:46:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:46:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:46:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:46:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:46:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:46:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:46:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:46:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:46:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:46:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:46:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:46:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,397 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 03:46:13,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:13,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813595292] [2023-12-16 03:46:13,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813595292] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:46:13,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:46:13,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 03:46:13,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267014868] [2023-12-16 03:46:13,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:46:13,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 03:46:13,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:13,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 03:46:13,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:46:13,407 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-16 03:46:13,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:46:13,445 INFO L93 Difference]: Finished difference Result 104 states and 155 transitions. [2023-12-16 03:46:13,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 03:46:13,445 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-16 03:46:13,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:46:13,448 INFO L225 Difference]: With dead ends: 104 [2023-12-16 03:46:13,448 INFO L226 Difference]: Without dead ends: 67 [2023-12-16 03:46:13,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:46:13,451 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 51 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:46:13,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 134 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:46:13,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-16 03:46:13,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 38. [2023-12-16 03:46:13,459 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-16 03:46:13,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 54 transitions. [2023-12-16 03:46:13,460 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 54 transitions. Word has length 96 [2023-12-16 03:46:13,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:46:13,461 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 54 transitions. [2023-12-16 03:46:13,461 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-16 03:46:13,461 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 54 transitions. [2023-12-16 03:46:13,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-16 03:46:13,463 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:13,463 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-16 03:46:13,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 03:46:13,464 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:13,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:13,465 INFO L85 PathProgramCache]: Analyzing trace with hash -367820160, now seen corresponding path program 1 times [2023-12-16 03:46:13,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:13,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394876340] [2023-12-16 03:46:13,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:13,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:46:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:46:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:46:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:46:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:46:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:46:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:46:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:46:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:46:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:46:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:46:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:46:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:46:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:13,734 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 03:46:13,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:13,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394876340] [2023-12-16 03:46:13,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394876340] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:46:13,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:46:13,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 03:46:13,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373578791] [2023-12-16 03:46:13,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:46:13,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 03:46:13,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:13,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 03:46:13,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:46:13,740 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-16 03:46:13,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:46:13,765 INFO L93 Difference]: Finished difference Result 75 states and 107 transitions. [2023-12-16 03:46:13,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 03:46:13,765 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-16 03:46:13,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:46:13,768 INFO L225 Difference]: With dead ends: 75 [2023-12-16 03:46:13,768 INFO L226 Difference]: Without dead ends: 38 [2023-12-16 03:46:13,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:46:13,772 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:46:13,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 49 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:46:13,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-16 03:46:13,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-16 03:46:13,784 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-16 03:46:13,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2023-12-16 03:46:13,787 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 96 [2023-12-16 03:46:13,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:46:13,788 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2023-12-16 03:46:13,789 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-16 03:46:13,789 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2023-12-16 03:46:13,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-16 03:46:13,792 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:13,793 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-16 03:46:13,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 03:46:13,793 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:13,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:13,793 INFO L85 PathProgramCache]: Analyzing trace with hash -367760578, now seen corresponding path program 1 times [2023-12-16 03:46:13,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:13,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899922345] [2023-12-16 03:46:13,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:13,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:17,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:17,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:46:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:17,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:17,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:46:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:17,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:17,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:46:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:17,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:46:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:17,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:46:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:17,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:46:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:17,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:46:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:17,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:46:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:17,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:46:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:17,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:46:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:17,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:46:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:17,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:46:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:17,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:46:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:17,648 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 03:46:17,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:17,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899922345] [2023-12-16 03:46:17,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899922345] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:46:17,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:46:17,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 03:46:17,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865349141] [2023-12-16 03:46:17,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:46:17,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 03:46:17,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:17,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 03:46:17,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 03:46:17,650 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-16 03:46:17,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:46:17,759 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2023-12-16 03:46:17,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 03:46:17,760 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-16 03:46:17,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:46:17,760 INFO L225 Difference]: With dead ends: 62 [2023-12-16 03:46:17,760 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 03:46:17,761 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-16 03:46:17,761 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 43 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:46:17,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 196 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:46:17,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 03:46:17,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 03:46:17,762 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-16 03:46:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 03:46:17,762 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 96 [2023-12-16 03:46:17,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:46:17,762 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 03:46:17,762 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-16 03:46:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 03:46:17,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 03:46:17,765 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 03:46:17,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 03:46:17,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 03:46:17,929 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-12-16 03:46:17,929 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-16 03:46:17,929 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-16 03:46:17,930 INFO L895 garLoopResultBuilder]: At program point L93-2(lines 93 99) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-16 03:46:17,930 INFO L899 garLoopResultBuilder]: For program point L93-3(lines 93 99) no Hoare annotation was computed. [2023-12-16 03:46:17,930 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-16 03:46:17,930 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-16 03:46:17,930 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-16 03:46:17,930 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-16 03:46:17,930 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-16 03:46:17,930 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 40 57) no Hoare annotation was computed. [2023-12-16 03:46:17,930 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-12-16 03:46:17,930 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-16 03:46:17,930 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-16 03:46:17,930 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2023-12-16 03:46:17,931 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-16 03:46:17,931 INFO L899 garLoopResultBuilder]: For program point L82(lines 58 83) no Hoare annotation was computed. [2023-12-16 03:46:17,931 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-16 03:46:17,931 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-16 03:46:17,931 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-12-16 03:46:17,931 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-16 03:46:17,931 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-16 03:46:17,931 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 03:46:17,931 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-12-16 03:46:17,931 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-16 03:46:17,931 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-16 03:46:17,931 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 03:46:17,932 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-12-16 03:46:17,932 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-16 03:46:17,932 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-16 03:46:17,932 INFO L899 garLoopResultBuilder]: For program point L51-1(lines 51 53) no Hoare annotation was computed. [2023-12-16 03:46:17,932 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-12-16 03:46:17,932 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2023-12-16 03:46:17,932 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 40 57) no Hoare annotation was computed. [2023-12-16 03:46:17,932 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-16 03:46:17,932 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-16 03:46:17,932 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-16 03:46:17,932 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-16 03:46:17,932 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-16 03:46:17,932 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-16 03:46:17,935 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-16 03:46:17,936 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 03:46:17,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:46:17 BoogieIcfgContainer [2023-12-16 03:46:17,943 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 03:46:17,943 INFO L158 Benchmark]: Toolchain (without parser) took 6148.69ms. Allocated memory was 313.5MB in the beginning and 451.9MB in the end (delta: 138.4MB). Free memory was 277.1MB in the beginning and 291.8MB in the end (delta: -14.7MB). Peak memory consumption was 124.3MB. Max. memory is 8.0GB. [2023-12-16 03:46:17,944 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 196.1MB. Free memory is still 149.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 03:46:17,944 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.37ms. Allocated memory is still 313.5MB. Free memory was 277.1MB in the beginning and 264.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 03:46:17,944 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.66ms. Allocated memory is still 313.5MB. Free memory was 264.0MB in the beginning and 259.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 03:46:17,944 INFO L158 Benchmark]: Boogie Preprocessor took 32.22ms. Allocated memory is still 313.5MB. Free memory was 259.8MB in the beginning and 253.0MB in the end (delta: 6.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-12-16 03:46:17,944 INFO L158 Benchmark]: RCFGBuilder took 564.80ms. Allocated memory is still 313.5MB. Free memory was 253.0MB in the beginning and 231.5MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-16 03:46:17,945 INFO L158 Benchmark]: TraceAbstraction took 5205.73ms. Allocated memory was 313.5MB in the beginning and 451.9MB in the end (delta: 138.4MB). Free memory was 230.4MB in the beginning and 291.8MB in the end (delta: -61.3MB). Peak memory consumption was 78.1MB. Max. memory is 8.0GB. [2023-12-16 03:46:17,946 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.12ms. Allocated memory is still 196.1MB. Free memory is still 149.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 271.37ms. Allocated memory is still 313.5MB. Free memory was 277.1MB in the beginning and 264.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.66ms. Allocated memory is still 313.5MB. Free memory was 264.0MB in the beginning and 259.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.22ms. Allocated memory is still 313.5MB. Free memory was 259.8MB in the beginning and 253.0MB in the end (delta: 6.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 564.80ms. Allocated memory is still 313.5MB. Free memory was 253.0MB in the beginning and 231.5MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 5205.73ms. Allocated memory was 313.5MB in the beginning and 451.9MB in the end (delta: 138.4MB). Free memory was 230.4MB in the beginning and 291.8MB in the end (delta: -61.3MB). Peak memory consumption was 78.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.2s, OverallIterations: 4, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 432 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 164 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 72 IncrementalHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 268 mSDtfsCounter, 72 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.0s 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, 762 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 810 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: 93]: Loop Invariant Derived loop invariant: ((25 <= var_1_1) && ((var_1_1 / 65536) <= 0)) RESULT: Ultimate proved your program to be correct! [2023-12-16 03:46:17,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...