/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-41.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:15:05,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:15:05,261 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 21:15:05,264 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:15:05,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:15:05,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:15:05,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:15:05,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:15:05,279 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:15:05,280 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:15:05,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:15:05,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:15:05,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:15:05,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:15:05,281 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:15:05,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:15:05,281 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:15:05,282 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:15:05,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:15:05,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:15:05,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:15:05,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:15:05,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:15:05,283 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:15:05,283 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:15:05,283 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:15:05,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:15:05,284 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:15:05,284 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:15:05,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:15:05,284 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:15:05,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:15:05,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:15:05,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:15:05,285 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:15:05,285 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:15:05,285 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:15:05,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:15:05,285 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:15:05,286 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:15:05,286 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:15:05,290 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:15:05,290 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:15:05,290 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 21:15:05,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:15:05,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:15:05,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:15:05,480 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:15:05,481 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:15:05,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-41.i [2023-12-15 21:15:06,539 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:15:06,711 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:15:06,713 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-41.i [2023-12-15 21:15:06,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c4a4cc48/e2ea4d0711de4c8b9f83307061d60902/FLAG9e632f4b7 [2023-12-15 21:15:06,734 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c4a4cc48/e2ea4d0711de4c8b9f83307061d60902 [2023-12-15 21:15:06,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:15:06,737 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:15:06,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:15:06,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:15:06,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:15:06,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:15:06" (1/1) ... [2023-12-15 21:15:06,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31a922ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:15:06, skipping insertion in model container [2023-12-15 21:15:06,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:15:06" (1/1) ... [2023-12-15 21:15:06,763 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:15:06,852 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_operatoramount_amount25_file-41.i[915,928] [2023-12-15 21:15:06,879 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:15:06,891 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:15:06,900 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_operatoramount_amount25_file-41.i[915,928] [2023-12-15 21:15:06,911 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:15:06,929 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:15:06,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:15:06 WrapperNode [2023-12-15 21:15:06,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:15:06,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:15:06,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:15:06,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:15:06,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:15:06" (1/1) ... [2023-12-15 21:15:06,942 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:15:06" (1/1) ... [2023-12-15 21:15:06,958 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2023-12-15 21:15:06,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:15:06,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:15:06,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:15:06,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:15:06,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:15:06" (1/1) ... [2023-12-15 21:15:06,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:15:06" (1/1) ... [2023-12-15 21:15:06,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:15:06" (1/1) ... [2023-12-15 21:15:06,977 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 21:15:06,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:15:06" (1/1) ... [2023-12-15 21:15:06,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:15:06" (1/1) ... [2023-12-15 21:15:06,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:15:06" (1/1) ... [2023-12-15 21:15:06,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:15:06" (1/1) ... [2023-12-15 21:15:06,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:15:06" (1/1) ... [2023-12-15 21:15:06,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:15:06" (1/1) ... [2023-12-15 21:15:06,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:15:06,995 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:15:06,995 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:15:06,995 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:15:06,996 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:15:06" (1/1) ... [2023-12-15 21:15:07,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:15:07,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:15:07,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 21:15:07,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 21:15:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:15:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:15:07,059 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:15:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:15:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:15:07,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:15:07,108 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:15:07,110 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:15:07,268 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:15:07,308 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:15:07,309 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:15:07,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:15:07 BoogieIcfgContainer [2023-12-15 21:15:07,309 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:15:07,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:15:07,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:15:07,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:15:07,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:15:06" (1/3) ... [2023-12-15 21:15:07,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d8fed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:15:07, skipping insertion in model container [2023-12-15 21:15:07,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:15:06" (2/3) ... [2023-12-15 21:15:07,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d8fed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:15:07, skipping insertion in model container [2023-12-15 21:15:07,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:15:07" (3/3) ... [2023-12-15 21:15:07,316 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-41.i [2023-12-15 21:15:07,329 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:15:07,329 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:15:07,360 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:15:07,365 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;@3cf9ff29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:15:07,365 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:15:07,368 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 21:15:07,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-15 21:15:07,386 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:15:07,387 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, 1, 1, 1] [2023-12-15 21:15:07,387 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:15:07,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:15:07,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1582176197, now seen corresponding path program 1 times [2023-12-15 21:15:07,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:15:07,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825492930] [2023-12-15 21:15:07,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:15:07,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:15:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:07,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:15:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:07,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:15:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:07,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:15:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:07,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:15:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:07,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:15:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:07,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:15:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:07,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:15:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:07,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:15:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:07,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:15:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:07,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:15:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:07,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:15:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:07,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:15:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:07,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:15:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:07,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:15:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:07,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 21:15:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:07,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 21:15:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:07,661 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:15:07,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:15:07,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825492930] [2023-12-15 21:15:07,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825492930] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:15:07,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:15:07,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:15:07,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753170201] [2023-12-15 21:15:07,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:15:07,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:15:07,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:15:07,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:15:07,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:15:07,706 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 21:15:07,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:15:07,751 INFO L93 Difference]: Finished difference Result 86 states and 150 transitions. [2023-12-15 21:15:07,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:15:07,754 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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 99 [2023-12-15 21:15:07,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:15:07,759 INFO L225 Difference]: With dead ends: 86 [2023-12-15 21:15:07,759 INFO L226 Difference]: Without dead ends: 42 [2023-12-15 21:15:07,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:15:07,765 INFO L413 NwaCegarLoop]: 58 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, 58 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:15:07,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:15:07,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-15 21:15:07,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-12-15 21:15:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 21:15:07,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2023-12-15 21:15:07,802 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 99 [2023-12-15 21:15:07,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:15:07,803 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2023-12-15 21:15:07,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 21:15:07,804 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2023-12-15 21:15:07,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-15 21:15:07,807 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:15:07,808 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, 1, 1, 1] [2023-12-15 21:15:07,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:15:07,808 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:15:07,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:15:07,809 INFO L85 PathProgramCache]: Analyzing trace with hash 509933509, now seen corresponding path program 1 times [2023-12-15 21:15:07,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:15:07,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707655549] [2023-12-15 21:15:07,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:15:07,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:15:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:09,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:15:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:09,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:15:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:09,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:15:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:09,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:15:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:09,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:15:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:09,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:15:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:09,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:15:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:09,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:15:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:09,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:15:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:09,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:15:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:09,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:15:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:09,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:15:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:09,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:15:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:09,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:15:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:09,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 21:15:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:09,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 21:15:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:09,287 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:15:09,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:15:09,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707655549] [2023-12-15 21:15:09,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707655549] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:15:09,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:15:09,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:15:09,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070931123] [2023-12-15 21:15:09,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:15:09,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:15:09,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:15:09,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:15:09,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:15:09,302 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:15:09,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:15:09,590 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2023-12-15 21:15:09,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 21:15:09,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 99 [2023-12-15 21:15:09,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:15:09,594 INFO L225 Difference]: With dead ends: 70 [2023-12-15 21:15:09,594 INFO L226 Difference]: Without dead ends: 68 [2023-12-15 21:15:09,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:15:09,596 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 39 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:15:09,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 199 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:15:09,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-15 21:15:09,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 50. [2023-12-15 21:15:09,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 21:15:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2023-12-15 21:15:09,620 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 99 [2023-12-15 21:15:09,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:15:09,622 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2023-12-15 21:15:09,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:15:09,623 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2023-12-15 21:15:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-15 21:15:09,627 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:15:09,627 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, 1, 1, 1] [2023-12-15 21:15:09,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:15:09,627 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:15:09,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:15:09,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2010026425, now seen corresponding path program 1 times [2023-12-15 21:15:09,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:15:09,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782922211] [2023-12-15 21:15:09,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:15:09,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:15:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:10,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:15:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:10,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:15:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:10,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:15:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:10,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:15:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:10,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:15:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:10,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:15:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:10,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:15:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:10,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:15:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:10,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:15:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:10,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:15:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:10,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:15:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:10,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:15:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:10,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:15:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:10,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:15:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:10,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 21:15:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:10,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 21:15:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:15:10,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:15:10,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782922211] [2023-12-15 21:15:10,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782922211] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:15:10,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:15:10,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:15:10,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052852830] [2023-12-15 21:15:10,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:15:10,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:15:10,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:15:10,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:15:10,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:15:10,290 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:15:10,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:15:10,452 INFO L93 Difference]: Finished difference Result 139 states and 196 transitions. [2023-12-15 21:15:10,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:15:10,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 99 [2023-12-15 21:15:10,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:15:10,455 INFO L225 Difference]: With dead ends: 139 [2023-12-15 21:15:10,455 INFO L226 Difference]: Without dead ends: 90 [2023-12-15 21:15:10,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:15:10,456 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 65 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:15:10,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 287 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:15:10,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-15 21:15:10,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2023-12-15 21:15:10,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 55 states have internal predecessors, (63), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:15:10,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2023-12-15 21:15:10,467 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 99 [2023-12-15 21:15:10,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:15:10,468 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2023-12-15 21:15:10,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:15:10,468 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2023-12-15 21:15:10,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-15 21:15:10,469 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:15:10,469 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, 1, 1, 1] [2023-12-15 21:15:10,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:15:10,469 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:15:10,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:15:10,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1189991879, now seen corresponding path program 1 times [2023-12-15 21:15:10,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:15:10,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646786723] [2023-12-15 21:15:10,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:15:10,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:15:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:15:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:15:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:15:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:15:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:15:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:15:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:15:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:15:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:15:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:15:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:15:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:15:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:15:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:15:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 21:15:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 21:15:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,078 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:15:11,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:15:11,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646786723] [2023-12-15 21:15:11,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646786723] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:15:11,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:15:11,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:15:11,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435055300] [2023-12-15 21:15:11,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:15:11,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:15:11,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:15:11,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:15:11,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:15:11,080 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:15:11,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:15:11,320 INFO L93 Difference]: Finished difference Result 101 states and 135 transitions. [2023-12-15 21:15:11,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:15:11,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 99 [2023-12-15 21:15:11,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:15:11,322 INFO L225 Difference]: With dead ends: 101 [2023-12-15 21:15:11,322 INFO L226 Difference]: Without dead ends: 99 [2023-12-15 21:15:11,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:15:11,323 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 30 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:15:11,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 231 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:15:11,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-15 21:15:11,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2023-12-15 21:15:11,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 61 states have internal predecessors, (71), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:15:11,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2023-12-15 21:15:11,333 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 99 [2023-12-15 21:15:11,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:15:11,333 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2023-12-15 21:15:11,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:15:11,333 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2023-12-15 21:15:11,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-15 21:15:11,334 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:15:11,334 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, 1, 1, 1] [2023-12-15 21:15:11,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:15:11,334 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:15:11,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:15:11,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1329968055, now seen corresponding path program 1 times [2023-12-15 21:15:11,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:15:11,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514763353] [2023-12-15 21:15:11,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:15:11,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:15:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:15:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:15:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:15:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:15:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:15:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:15:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:15:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:15:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:15:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:15:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:15:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:15:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:15:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:15:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 21:15:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 21:15:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,783 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:15:11,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:15:11,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514763353] [2023-12-15 21:15:11,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514763353] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:15:11,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:15:11,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:15:11,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770612221] [2023-12-15 21:15:11,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:15:11,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:15:11,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:15:11,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:15:11,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:15:11,786 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:15:11,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:15:11,916 INFO L93 Difference]: Finished difference Result 102 states and 136 transitions. [2023-12-15 21:15:11,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:15:11,917 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 99 [2023-12-15 21:15:11,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:15:11,918 INFO L225 Difference]: With dead ends: 102 [2023-12-15 21:15:11,918 INFO L226 Difference]: Without dead ends: 100 [2023-12-15 21:15:11,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:15:11,920 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 34 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:15:11,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 202 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:15:11,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-15 21:15:11,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2023-12-15 21:15:11,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 57 states have internal predecessors, (65), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:15:11,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2023-12-15 21:15:11,936 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 99 [2023-12-15 21:15:11,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:15:11,937 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2023-12-15 21:15:11,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:15:11,937 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2023-12-15 21:15:11,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-15 21:15:11,938 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:15:11,938 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, 1, 1, 1, 1] [2023-12-15 21:15:11,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:15:11,938 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:15:11,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:15:11,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1381377011, now seen corresponding path program 1 times [2023-12-15 21:15:11,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:15:11,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658538627] [2023-12-15 21:15:11,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:15:11,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:15:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:15:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:15:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:15:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:15:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:15:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:11,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:15:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:12,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:15:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:12,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:15:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:12,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:15:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:12,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:15:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:12,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:15:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:12,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:15:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:12,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:15:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:12,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:15:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:12,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 21:15:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:12,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 21:15:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:15:12,015 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:15:12,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:15:12,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658538627] [2023-12-15 21:15:12,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658538627] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:15:12,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:15:12,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:15:12,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132327088] [2023-12-15 21:15:12,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:15:12,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:15:12,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:15:12,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:15:12,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:15:12,018 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:15:12,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:15:12,035 INFO L93 Difference]: Finished difference Result 160 states and 221 transitions. [2023-12-15 21:15:12,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:15:12,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (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 100 [2023-12-15 21:15:12,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:15:12,036 INFO L225 Difference]: With dead ends: 160 [2023-12-15 21:15:12,036 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 21:15:12,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:15:12,039 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:15:12,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 102 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:15:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 21:15:12,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 21:15:12,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:15:12,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 21:15:12,042 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2023-12-15 21:15:12,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:15:12,042 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 21:15:12,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:15:12,042 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 21:15:12,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 21:15:12,045 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:15:12,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 21:15:12,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 21:15:12,246 INFO L902 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: true [2023-12-15 21:15:12,246 INFO L902 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: true [2023-12-15 21:15:12,247 INFO L895 garLoopResultBuilder]: At program point L97-2(lines 97 103) the Hoare annotation is: (or (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) (let ((.cse2 (* (div ~var_1_8~0 256) 256))) (let ((.cse0 (= (+ .cse2 1) ~var_1_8~0)) (.cse1 (= (* (div ~var_1_9~0 256) 256) ~var_1_9~0))) (and (or .cse0 (and .cse1 (= .cse2 ~var_1_8~0))) (or (not .cse0) (not .cse1)))))) [2023-12-15 21:15:12,247 INFO L899 garLoopResultBuilder]: For program point L97-3(lines 97 103) no Hoare annotation was computed. [2023-12-15 21:15:12,247 INFO L902 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: true [2023-12-15 21:15:12,247 INFO L902 garLoopResultBuilder]: At program point L85-1(line 85) the Hoare annotation is: true [2023-12-15 21:15:12,247 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 60) no Hoare annotation was computed. [2023-12-15 21:15:12,247 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-15 21:15:12,247 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-15 21:15:12,247 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-15 21:15:12,247 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-12-15 21:15:12,247 INFO L902 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: true [2023-12-15 21:15:12,247 INFO L902 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: true [2023-12-15 21:15:12,247 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 61) no Hoare annotation was computed. [2023-12-15 21:15:12,247 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-12-15 21:15:12,248 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-15 21:15:12,248 INFO L899 garLoopResultBuilder]: For program point L86(lines 62 87) no Hoare annotation was computed. [2023-12-15 21:15:12,248 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2023-12-15 21:15:12,248 INFO L902 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: true [2023-12-15 21:15:12,248 INFO L902 garLoopResultBuilder]: At program point L82-1(line 82) the Hoare annotation is: true [2023-12-15 21:15:12,248 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-12-15 21:15:12,248 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 45) no Hoare annotation was computed. [2023-12-15 21:15:12,248 INFO L899 garLoopResultBuilder]: For program point L41-2(lines 36 61) no Hoare annotation was computed. [2023-12-15 21:15:12,248 INFO L902 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: true [2023-12-15 21:15:12,248 INFO L902 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: true [2023-12-15 21:15:12,248 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 39) no Hoare annotation was computed. [2023-12-15 21:15:12,248 INFO L899 garLoopResultBuilder]: For program point L37-2(lines 37 39) no Hoare annotation was computed. [2023-12-15 21:15:12,248 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 21:15:12,248 INFO L899 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2023-12-15 21:15:12,248 INFO L902 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: true [2023-12-15 21:15:12,249 INFO L902 garLoopResultBuilder]: At program point L79-1(line 79) the Hoare annotation is: true [2023-12-15 21:15:12,249 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 50) no Hoare annotation was computed. [2023-12-15 21:15:12,249 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 21:15:12,249 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-12-15 21:15:12,249 INFO L902 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: true [2023-12-15 21:15:12,249 INFO L902 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: true [2023-12-15 21:15:12,249 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-12-15 21:15:12,249 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 49) no Hoare annotation was computed. [2023-12-15 21:15:12,249 INFO L902 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: true [2023-12-15 21:15:12,249 INFO L902 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: true [2023-12-15 21:15:12,249 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-12-15 21:15:12,249 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-15 21:15:12,249 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-15 21:15:12,249 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-15 21:15:12,249 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-15 21:15:12,252 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-15 21:15:12,253 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:15:12,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:15:12 BoogieIcfgContainer [2023-12-15 21:15:12,261 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:15:12,262 INFO L158 Benchmark]: Toolchain (without parser) took 5524.97ms. Allocated memory was 212.9MB in the beginning and 342.9MB in the end (delta: 130.0MB). Free memory was 172.6MB in the beginning and 274.3MB in the end (delta: -101.7MB). Peak memory consumption was 191.4MB. Max. memory is 8.0GB. [2023-12-15 21:15:12,262 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 212.9MB. Free memory was 165.7MB in the beginning and 165.5MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:15:12,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.56ms. Allocated memory is still 212.9MB. Free memory was 172.2MB in the beginning and 160.2MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-15 21:15:12,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.43ms. Allocated memory is still 212.9MB. Free memory was 160.2MB in the beginning and 158.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:15:12,262 INFO L158 Benchmark]: Boogie Preprocessor took 27.30ms. Allocated memory is still 212.9MB. Free memory was 158.2MB in the beginning and 156.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:15:12,263 INFO L158 Benchmark]: RCFGBuilder took 314.16ms. Allocated memory is still 212.9MB. Free memory was 156.1MB in the beginning and 140.3MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-15 21:15:12,263 INFO L158 Benchmark]: TraceAbstraction took 4950.29ms. Allocated memory was 212.9MB in the beginning and 342.9MB in the end (delta: 130.0MB). Free memory was 139.7MB in the beginning and 274.3MB in the end (delta: -134.6MB). Peak memory consumption was 157.8MB. Max. memory is 8.0GB. [2023-12-15 21:15:12,264 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.10ms. Allocated memory is still 212.9MB. Free memory was 165.7MB in the beginning and 165.5MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.56ms. Allocated memory is still 212.9MB. Free memory was 172.2MB in the beginning and 160.2MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.43ms. Allocated memory is still 212.9MB. Free memory was 160.2MB in the beginning and 158.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.30ms. Allocated memory is still 212.9MB. Free memory was 158.2MB in the beginning and 156.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 314.16ms. Allocated memory is still 212.9MB. Free memory was 156.1MB in the beginning and 140.3MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 4950.29ms. Allocated memory was 212.9MB in the beginning and 342.9MB in the end (delta: 130.0MB). Free memory was 139.7MB in the beginning and 274.3MB in the end (delta: -134.6MB). Peak memory consumption was 157.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 1079 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 717 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 313 IncrementalHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 362 mSDtfsCounter, 313 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=4, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 50 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 101 PreInvPairs, 130 NumberOfFragments, 70 HoareAnnotationTreeSize, 101 FormulaSimplifications, 770 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FormulaSimplificationsInter, 1179 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 595 NumberOfCodeBlocks, 595 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 589 ConstructedInterpolants, 0 QuantifiedInterpolants, 2321 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 2880/2880 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: 97]: Loop Invariant Derived loop invariant: ((var_1_5 == ((var_1_5 / 256) * 256)) || ((((((var_1_8 / 256) * 256) + 1) == var_1_8) || ((((var_1_9 / 256) * 256) == var_1_9) && (((var_1_8 / 256) * 256) == var_1_8))) && (!(((((var_1_8 / 256) * 256) + 1) == var_1_8)) || !((((var_1_9 / 256) * 256) == var_1_9))))) RESULT: Ultimate proved your program to be correct! [2023-12-15 21:15:12,300 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...