/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_fillercode_fillercodesize_ps-cn-25_file-10.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 02:54:01,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 02:54:01,944 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 02:54:01,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 02:54:01,957 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 02:54:01,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 02:54:01,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 02:54:01,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 02:54:01,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 02:54:01,989 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 02:54:01,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 02:54:01,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 02:54:01,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 02:54:01,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 02:54:01,991 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 02:54:01,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 02:54:01,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 02:54:01,992 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 02:54:01,992 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 02:54:01,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 02:54:01,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 02:54:01,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 02:54:01,993 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 02:54:01,993 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 02:54:01,993 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 02:54:01,993 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 02:54:01,994 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 02:54:01,994 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 02:54:01,994 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 02:54:01,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 02:54:01,995 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 02:54:01,995 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 02:54:01,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 02:54:01,996 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 02:54:01,996 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 02:54:01,996 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 02:54:01,996 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 02:54:01,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 02:54:01,996 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 02:54:01,996 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 02:54:01,996 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 02:54:01,997 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 02:54:01,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 02:54:01,997 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 02:54:02,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 02:54:02,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 02:54:02,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 02:54:02,214 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 02:54:02,214 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 02:54:02,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-10.i [2023-12-16 02:54:03,210 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 02:54:03,365 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 02:54:03,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-10.i [2023-12-16 02:54:03,372 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1b97ac96/adaf6405b8514e8a82870bc933c29961/FLAGe9ec2aee7 [2023-12-16 02:54:03,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1b97ac96/adaf6405b8514e8a82870bc933c29961 [2023-12-16 02:54:03,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 02:54:03,386 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 02:54:03,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 02:54:03,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 02:54:03,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 02:54:03,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:54:03" (1/1) ... [2023-12-16 02:54:03,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@293f9e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:54:03, skipping insertion in model container [2023-12-16 02:54:03,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:54:03" (1/1) ... [2023-12-16 02:54:03,417 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 02:54:03,535 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_fillercode_fillercodesize_ps-cn-25_file-10.i[915,928] [2023-12-16 02:54:03,589 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 02:54:03,597 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 02:54:03,609 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_fillercode_fillercodesize_ps-cn-25_file-10.i[915,928] [2023-12-16 02:54:03,634 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 02:54:03,651 INFO L206 MainTranslator]: Completed translation [2023-12-16 02:54:03,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:54:03 WrapperNode [2023-12-16 02:54:03,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 02:54:03,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 02:54:03,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 02:54:03,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 02:54:03,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:54:03" (1/1) ... [2023-12-16 02:54:03,676 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:54:03" (1/1) ... [2023-12-16 02:54:03,705 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2023-12-16 02:54:03,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 02:54:03,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 02:54:03,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 02:54:03,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 02:54:03,726 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:54:03" (1/1) ... [2023-12-16 02:54:03,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:54:03" (1/1) ... [2023-12-16 02:54:03,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:54:03" (1/1) ... [2023-12-16 02:54:03,742 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 02:54:03,742 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:54:03" (1/1) ... [2023-12-16 02:54:03,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:54:03" (1/1) ... [2023-12-16 02:54:03,751 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:54:03" (1/1) ... [2023-12-16 02:54:03,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:54:03" (1/1) ... [2023-12-16 02:54:03,755 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:54:03" (1/1) ... [2023-12-16 02:54:03,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:54:03" (1/1) ... [2023-12-16 02:54:03,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 02:54:03,764 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 02:54:03,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 02:54:03,765 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 02:54:03,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:54:03" (1/1) ... [2023-12-16 02:54:03,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 02:54:03,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 02:54:03,787 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 02:54:03,790 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 02:54:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 02:54:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 02:54:03,810 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 02:54:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 02:54:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 02:54:03,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 02:54:03,900 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 02:54:03,903 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 02:54:04,240 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 02:54:04,267 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 02:54:04,267 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 02:54:04,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:54:04 BoogieIcfgContainer [2023-12-16 02:54:04,268 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 02:54:04,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 02:54:04,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 02:54:04,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 02:54:04,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 02:54:03" (1/3) ... [2023-12-16 02:54:04,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17652755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:54:04, skipping insertion in model container [2023-12-16 02:54:04,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:54:03" (2/3) ... [2023-12-16 02:54:04,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17652755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:54:04, skipping insertion in model container [2023-12-16 02:54:04,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:54:04" (3/3) ... [2023-12-16 02:54:04,274 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-10.i [2023-12-16 02:54:04,304 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 02:54:04,305 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 02:54:04,337 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 02:54:04,342 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;@1d7ebf3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 02:54:04,343 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 02:54:04,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 56 states have internal predecessors, (76), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-16 02:54:04,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2023-12-16 02:54:04,358 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 02:54:04,359 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:54:04,359 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 02:54:04,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 02:54:04,363 INFO L85 PathProgramCache]: Analyzing trace with hash -29664266, now seen corresponding path program 1 times [2023-12-16 02:54:04,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 02:54:04,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44129168] [2023-12-16 02:54:04,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 02:54:04,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 02:54:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 02:54:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 02:54:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 02:54:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 02:54:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 02:54:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 02:54:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 02:54:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 02:54:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 02:54:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 02:54:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 02:54:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 02:54:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 02:54:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 02:54:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 02:54:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 02:54:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 02:54:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 02:54:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 02:54:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-16 02:54:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-16 02:54:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-16 02:54:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-16 02:54:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-16 02:54:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-16 02:54:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-16 02:54:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-16 02:54:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-16 02:54:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-16 02:54:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-16 02:54:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-16 02:54:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-16 02:54:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:04,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-16 02:54:04,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 02:54:04,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44129168] [2023-12-16 02:54:04,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44129168] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 02:54:04,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 02:54:04,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 02:54:04,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129320249] [2023-12-16 02:54:04,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 02:54:04,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 02:54:04,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 02:54:04,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 02:54:04,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 02:54:04,845 INFO L87 Difference]: Start difference. First operand has 90 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 56 states have internal predecessors, (76), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-16 02:54:04,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 02:54:04,889 INFO L93 Difference]: Finished difference Result 177 states and 310 transitions. [2023-12-16 02:54:04,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 02:54:04,891 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 204 [2023-12-16 02:54:04,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 02:54:04,899 INFO L225 Difference]: With dead ends: 177 [2023-12-16 02:54:04,899 INFO L226 Difference]: Without dead ends: 88 [2023-12-16 02:54:04,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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 02:54:04,908 INFO L413 NwaCegarLoop]: 132 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, 132 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 02:54:04,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 02:54:04,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-16 02:54:04,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-12-16 02:54:04,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-16 02:54:04,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 135 transitions. [2023-12-16 02:54:04,952 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 135 transitions. Word has length 204 [2023-12-16 02:54:04,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 02:54:04,953 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 135 transitions. [2023-12-16 02:54:04,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-16 02:54:04,953 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 135 transitions. [2023-12-16 02:54:04,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2023-12-16 02:54:04,956 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 02:54:04,956 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:54:04,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 02:54:04,956 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 02:54:04,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 02:54:04,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1510760566, now seen corresponding path program 1 times [2023-12-16 02:54:04,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 02:54:04,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510537322] [2023-12-16 02:54:04,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 02:54:04,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 02:54:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 02:54:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 02:54:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 02:54:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 02:54:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 02:54:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 02:54:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 02:54:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 02:54:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 02:54:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 02:54:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 02:54:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 02:54:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 02:54:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 02:54:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 02:54:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 02:54:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 02:54:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 02:54:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 02:54:05,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-16 02:54:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-16 02:54:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-16 02:54:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-16 02:54:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-16 02:54:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-16 02:54:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-16 02:54:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-16 02:54:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-16 02:54:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-16 02:54:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-16 02:54:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-16 02:54:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-16 02:54:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:05,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-16 02:54:05,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 02:54:05,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510537322] [2023-12-16 02:54:05,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510537322] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 02:54:05,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 02:54:05,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 02:54:05,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723660582] [2023-12-16 02:54:05,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 02:54:05,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 02:54:05,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 02:54:05,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 02:54:05,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 02:54:05,407 INFO L87 Difference]: Start difference. First operand 88 states and 135 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-16 02:54:05,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 02:54:05,617 INFO L93 Difference]: Finished difference Result 263 states and 404 transitions. [2023-12-16 02:54:05,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 02:54:05,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2023-12-16 02:54:05,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 02:54:05,625 INFO L225 Difference]: With dead ends: 263 [2023-12-16 02:54:05,625 INFO L226 Difference]: Without dead ends: 176 [2023-12-16 02:54:05,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 02:54:05,628 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 105 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 02:54:05,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 510 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 02:54:05,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-12-16 02:54:05,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 152. [2023-12-16 02:54:05,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 85 states have internal predecessors, (106), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-16 02:54:05,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 234 transitions. [2023-12-16 02:54:05,668 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 234 transitions. Word has length 204 [2023-12-16 02:54:05,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 02:54:05,669 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 234 transitions. [2023-12-16 02:54:05,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-16 02:54:05,670 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 234 transitions. [2023-12-16 02:54:05,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-12-16 02:54:05,676 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 02:54:05,676 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:54:05,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 02:54:05,677 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 02:54:05,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 02:54:05,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1791963892, now seen corresponding path program 1 times [2023-12-16 02:54:05,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 02:54:05,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26176835] [2023-12-16 02:54:05,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 02:54:05,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 02:54:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 02:54:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 02:54:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 02:54:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 02:54:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 02:54:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 02:54:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 02:54:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 02:54:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 02:54:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 02:54:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 02:54:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 02:54:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 02:54:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 02:54:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 02:54:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 02:54:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 02:54:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 02:54:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 02:54:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-16 02:54:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-16 02:54:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-16 02:54:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-16 02:54:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-16 02:54:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-16 02:54:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-16 02:54:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-16 02:54:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-16 02:54:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-16 02:54:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-16 02:54:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-16 02:54:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-16 02:54:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-16 02:54:17,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 02:54:17,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26176835] [2023-12-16 02:54:17,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26176835] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 02:54:17,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 02:54:17,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-16 02:54:17,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338769430] [2023-12-16 02:54:17,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 02:54:17,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 02:54:17,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 02:54:17,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 02:54:17,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-16 02:54:17,887 INFO L87 Difference]: Start difference. First operand 152 states and 234 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-16 02:54:19,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 02:54:19,683 INFO L93 Difference]: Finished difference Result 397 states and 597 transitions. [2023-12-16 02:54:19,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 02:54:19,683 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2023-12-16 02:54:19,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 02:54:19,686 INFO L225 Difference]: With dead ends: 397 [2023-12-16 02:54:19,686 INFO L226 Difference]: Without dead ends: 310 [2023-12-16 02:54:19,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2023-12-16 02:54:19,688 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 287 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 02:54:19,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 837 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 02:54:19,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2023-12-16 02:54:19,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 244. [2023-12-16 02:54:19,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 143 states have (on average 1.2447552447552448) internal successors, (178), 144 states have internal predecessors, (178), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-16 02:54:19,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 370 transitions. [2023-12-16 02:54:19,726 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 370 transitions. Word has length 205 [2023-12-16 02:54:19,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 02:54:19,728 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 370 transitions. [2023-12-16 02:54:19,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-16 02:54:19,728 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 370 transitions. [2023-12-16 02:54:19,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-12-16 02:54:19,730 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 02:54:19,731 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:54:19,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 02:54:19,731 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 02:54:19,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 02:54:19,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1985850380, now seen corresponding path program 1 times [2023-12-16 02:54:19,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 02:54:19,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144048938] [2023-12-16 02:54:19,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 02:54:19,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 02:54:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 02:54:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 02:54:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 02:54:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 02:54:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 02:54:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 02:54:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 02:54:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 02:54:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 02:54:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 02:54:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 02:54:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 02:54:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 02:54:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 02:54:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 02:54:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 02:54:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 02:54:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 02:54:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 02:54:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-16 02:54:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-16 02:54:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-16 02:54:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-16 02:54:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-16 02:54:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-16 02:54:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-16 02:54:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-16 02:54:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-16 02:54:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-16 02:54:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-16 02:54:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-16 02:54:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-16 02:54:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:54:44,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-16 02:54:44,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 02:54:44,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144048938] [2023-12-16 02:54:44,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144048938] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 02:54:44,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 02:54:44,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-12-16 02:54:44,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575927881] [2023-12-16 02:54:44,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 02:54:44,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-16 02:54:44,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 02:54:44,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-16 02:54:44,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2023-12-16 02:54:44,975 INFO L87 Difference]: Start difference. First operand 244 states and 370 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 3 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2023-12-16 02:54:51,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 02:54:56,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 02:55:02,087 WARN L293 SmtUtils]: Spent 5.08s on a formula simplification. DAG size of input: 207 DAG size of output: 154 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-16 02:55:07,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 02:55:08,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 02:55:08,041 INFO L93 Difference]: Finished difference Result 587 states and 862 transitions. [2023-12-16 02:55:08,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-16 02:55:08,041 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 3 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 205 [2023-12-16 02:55:08,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 02:55:08,044 INFO L225 Difference]: With dead ends: 587 [2023-12-16 02:55:08,044 INFO L226 Difference]: Without dead ends: 400 [2023-12-16 02:55:08,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=402, Invalid=1320, Unknown=0, NotChecked=0, Total=1722 [2023-12-16 02:55:08,047 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 546 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 158 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2023-12-16 02:55:08,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 828 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1141 Invalid, 3 Unknown, 0 Unchecked, 14.6s Time] [2023-12-16 02:55:08,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2023-12-16 02:55:08,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 292. [2023-12-16 02:55:08,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 189 states have (on average 1.2857142857142858) internal successors, (243), 189 states have internal predecessors, (243), 96 states have call successors, (96), 6 states have call predecessors, (96), 6 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-16 02:55:08,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 435 transitions. [2023-12-16 02:55:08,069 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 435 transitions. Word has length 205 [2023-12-16 02:55:08,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 02:55:08,070 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 435 transitions. [2023-12-16 02:55:08,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 3 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2023-12-16 02:55:08,070 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 435 transitions. [2023-12-16 02:55:08,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-12-16 02:55:08,072 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 02:55:08,072 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:55:08,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 02:55:08,072 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 02:55:08,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 02:55:08,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1176503754, now seen corresponding path program 1 times [2023-12-16 02:55:08,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 02:55:08,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408385395] [2023-12-16 02:55:08,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 02:55:08,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 02:55:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2023-12-16 02:55:11,163 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 02:55:11,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 02:55:11,165 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 206 with TraceHistMax 32,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∨-2-3-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-23-4-3-4-3-3-5-2-2-1 context. [2023-12-16 02:55:11,168 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-16 02:55:11,170 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 02:55:11,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 02:55:11 BoogieIcfgContainer [2023-12-16 02:55:11,171 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 02:55:11,172 INFO L158 Benchmark]: Toolchain (without parser) took 67785.45ms. Allocated memory was 215.0MB in the beginning and 682.6MB in the end (delta: 467.7MB). Free memory was 166.0MB in the beginning and 445.5MB in the end (delta: -279.6MB). Peak memory consumption was 399.6MB. Max. memory is 8.0GB. [2023-12-16 02:55:11,172 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 215.0MB. Free memory is still 167.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 02:55:11,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.11ms. Allocated memory is still 215.0MB. Free memory was 166.0MB in the beginning and 149.5MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-16 02:55:11,172 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.85ms. Allocated memory is still 215.0MB. Free memory was 149.5MB in the beginning and 144.6MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 02:55:11,172 INFO L158 Benchmark]: Boogie Preprocessor took 53.96ms. Allocated memory is still 215.0MB. Free memory was 144.6MB in the beginning and 136.6MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-12-16 02:55:11,173 INFO L158 Benchmark]: RCFGBuilder took 503.51ms. Allocated memory was 215.0MB in the beginning and 277.9MB in the end (delta: 62.9MB). Free memory was 136.6MB in the beginning and 232.0MB in the end (delta: -95.5MB). Peak memory consumption was 21.1MB. Max. memory is 8.0GB. [2023-12-16 02:55:11,174 INFO L158 Benchmark]: TraceAbstraction took 66901.99ms. Allocated memory was 277.9MB in the beginning and 682.6MB in the end (delta: 404.8MB). Free memory was 231.0MB in the beginning and 445.5MB in the end (delta: -214.5MB). Peak memory consumption was 400.5MB. Max. memory is 8.0GB. [2023-12-16 02:55:11,175 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 215.0MB. Free memory is still 167.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 263.11ms. Allocated memory is still 215.0MB. Free memory was 166.0MB in the beginning and 149.5MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.85ms. Allocated memory is still 215.0MB. Free memory was 149.5MB in the beginning and 144.6MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.96ms. Allocated memory is still 215.0MB. Free memory was 144.6MB in the beginning and 136.6MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 503.51ms. Allocated memory was 215.0MB in the beginning and 277.9MB in the end (delta: 62.9MB). Free memory was 136.6MB in the beginning and 232.0MB in the end (delta: -95.5MB). Peak memory consumption was 21.1MB. Max. memory is 8.0GB. * TraceAbstraction took 66901.99ms. Allocated memory was 277.9MB in the beginning and 682.6MB in the end (delta: 404.8MB). Free memory was 231.0MB in the beginning and 445.5MB in the end (delta: -214.5MB). Peak memory consumption was 400.5MB. 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 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 206 with TraceHistMax 32,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∨-2-3-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-23-4-3-4-3-3-5-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 66.8s, OverallIterations: 5, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 25.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 938 SdHoareTripleChecker+Valid, 15.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 938 mSDsluCounter, 2307 SdHoareTripleChecker+Invalid, 15.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1797 mSDsCounter, 366 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2007 IncrementalHoareTripleChecker+Invalid, 2376 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 366 mSolverCounterUnsat, 510 mSDtfsCounter, 2007 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 378 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 14.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=292occurred in iteration=4, InterpolantAutomatonStates: 58, 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, 198 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 37.7s InterpolantComputationTime, 818 NumberOfCodeBlocks, 818 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 814 ConstructedInterpolants, 0 QuantifiedInterpolants, 7730 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 7936/7936 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown