/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-23.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 03:56:00,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 03:56:00,543 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 03:56:00,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 03:56:00,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 03:56:00,575 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 03:56:00,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 03:56:00,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 03:56:00,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 03:56:00,579 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 03:56:00,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 03:56:00,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 03:56:00,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 03:56:00,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 03:56:00,581 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 03:56:00,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 03:56:00,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 03:56:00,581 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 03:56:00,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 03:56:00,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 03:56:00,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 03:56:00,583 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 03:56:00,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 03:56:00,583 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 03:56:00,583 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 03:56:00,583 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 03:56:00,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 03:56:00,584 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 03:56:00,584 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 03:56:00,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 03:56:00,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 03:56:00,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 03:56:00,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:56:00,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 03:56:00,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 03:56:00,586 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 03:56:00,586 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 03:56:00,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 03:56:00,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 03:56:00,587 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 03:56:00,587 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 03:56:00,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 03:56:00,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 03:56:00,587 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 03:56:00,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 03:56:00,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 03:56:00,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 03:56:00,816 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 03:56:00,817 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 03:56:00,818 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-23.i [2023-12-16 03:56:01,840 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 03:56:01,980 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 03:56:01,980 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-23.i [2023-12-16 03:56:01,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6011145f6/4af2b566d91c4cca8d4397b93ea2959d/FLAG194a295f3 [2023-12-16 03:56:02,002 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6011145f6/4af2b566d91c4cca8d4397b93ea2959d [2023-12-16 03:56:02,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 03:56:02,005 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 03:56:02,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 03:56:02,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 03:56:02,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 03:56:02,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:56:02" (1/1) ... [2023-12-16 03:56:02,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a54dbef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:02, skipping insertion in model container [2023-12-16 03:56:02,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:56:02" (1/1) ... [2023-12-16 03:56:02,032 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 03:56:02,142 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_amount10_file-23.i[915,928] [2023-12-16 03:56:02,165 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:56:02,173 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 03:56:02,182 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_amount10_file-23.i[915,928] [2023-12-16 03:56:02,190 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:56:02,203 INFO L206 MainTranslator]: Completed translation [2023-12-16 03:56:02,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:02 WrapperNode [2023-12-16 03:56:02,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 03:56:02,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 03:56:02,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 03:56:02,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 03:56:02,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:02" (1/1) ... [2023-12-16 03:56:02,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:02" (1/1) ... [2023-12-16 03:56:02,235 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2023-12-16 03:56:02,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 03:56:02,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 03:56:02,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 03:56:02,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 03:56:02,243 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:02" (1/1) ... [2023-12-16 03:56:02,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:02" (1/1) ... [2023-12-16 03:56:02,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:02" (1/1) ... [2023-12-16 03:56:02,251 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 03:56:02,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:02" (1/1) ... [2023-12-16 03:56:02,252 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:02" (1/1) ... [2023-12-16 03:56:02,254 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:02" (1/1) ... [2023-12-16 03:56:02,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:02" (1/1) ... [2023-12-16 03:56:02,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:02" (1/1) ... [2023-12-16 03:56:02,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:02" (1/1) ... [2023-12-16 03:56:02,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 03:56:02,272 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 03:56:02,272 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 03:56:02,273 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 03:56:02,273 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:02" (1/1) ... [2023-12-16 03:56:02,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:56:02,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:56:02,345 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 03:56:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 03:56:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 03:56:02,369 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 03:56:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 03:56:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 03:56:02,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 03:56:02,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 03:56:02,415 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 03:56:02,417 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 03:56:02,590 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 03:56:02,611 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 03:56:02,612 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 03:56:02,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:56:02 BoogieIcfgContainer [2023-12-16 03:56:02,612 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 03:56:02,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 03:56:02,614 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 03:56:02,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 03:56:02,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:56:02" (1/3) ... [2023-12-16 03:56:02,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f622961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:56:02, skipping insertion in model container [2023-12-16 03:56:02,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:02" (2/3) ... [2023-12-16 03:56:02,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f622961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:56:02, skipping insertion in model container [2023-12-16 03:56:02,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:56:02" (3/3) ... [2023-12-16 03:56:02,622 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-23.i [2023-12-16 03:56:02,633 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 03:56:02,633 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 03:56:02,662 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 03:56:02,666 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;@7665f618, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 03:56:02,666 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 03:56:02,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 03:56:02,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-16 03:56:02,680 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:56:02,681 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:56:02,681 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:56:02,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:56:02,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1948547098, now seen corresponding path program 1 times [2023-12-16 03:56:02,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:56:02,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796068046] [2023-12-16 03:56:02,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:56:02,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:56:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:02,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:56:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:02,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:56:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:02,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:56:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:02,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:56:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:02,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:56:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:02,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:56:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:02,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:56:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:02,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:56:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:02,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:56:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:02,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:56:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:02,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:56:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:02,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:56:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:02,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:56:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:02,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:56:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:02,876 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 03:56:02,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:56:02,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796068046] [2023-12-16 03:56:02,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796068046] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:56:02,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:56:02,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 03:56:02,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670994664] [2023-12-16 03:56:02,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:56:02,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 03:56:02,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:56:02,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 03:56:02,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:56:02,901 INFO L87 Difference]: Start difference. First operand has 42 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 03:56:02,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:56:02,947 INFO L93 Difference]: Finished difference Result 81 states and 140 transitions. [2023-12-16 03:56:02,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 03:56:02,949 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 85 [2023-12-16 03:56:02,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:56:02,955 INFO L225 Difference]: With dead ends: 81 [2023-12-16 03:56:02,955 INFO L226 Difference]: Without dead ends: 40 [2023-12-16 03:56:02,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:56:02,962 INFO L413 NwaCegarLoop]: 56 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, 56 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:56:02,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:56:02,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-16 03:56:02,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-12-16 03:56:02,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 03:56:02,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2023-12-16 03:56:02,998 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 85 [2023-12-16 03:56:02,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:56:02,998 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2023-12-16 03:56:02,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 03:56:02,999 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2023-12-16 03:56:03,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-16 03:56:03,003 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:56:03,003 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:56:03,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 03:56:03,004 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:56:03,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:56:03,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1260279514, now seen corresponding path program 1 times [2023-12-16 03:56:03,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:56:03,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424642305] [2023-12-16 03:56:03,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:56:03,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:56:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:56:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:56:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:56:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:56:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:56:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:56:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:56:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:56:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:56:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:56:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:56:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:56:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:56:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:56:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,543 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 03:56:03,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:56:03,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424642305] [2023-12-16 03:56:03,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424642305] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:56:03,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:56:03,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 03:56:03,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245595899] [2023-12-16 03:56:03,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:56:03,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 03:56:03,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:56:03,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 03:56:03,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 03:56:03,546 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 03:56:03,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:56:03,602 INFO L93 Difference]: Finished difference Result 76 states and 108 transitions. [2023-12-16 03:56:03,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 03:56:03,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 85 [2023-12-16 03:56:03,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:56:03,606 INFO L225 Difference]: With dead ends: 76 [2023-12-16 03:56:03,606 INFO L226 Difference]: Without dead ends: 74 [2023-12-16 03:56:03,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 03:56:03,608 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 46 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:56:03,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 208 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:56:03,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-12-16 03:56:03,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2023-12-16 03:56:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-16 03:56:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 104 transitions. [2023-12-16 03:56:03,630 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 104 transitions. Word has length 85 [2023-12-16 03:56:03,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:56:03,630 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 104 transitions. [2023-12-16 03:56:03,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 03:56:03,631 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 104 transitions. [2023-12-16 03:56:03,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-16 03:56:03,631 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:56:03,632 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:56:03,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 03:56:03,632 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:56:03,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:56:03,632 INFO L85 PathProgramCache]: Analyzing trace with hash -786524736, now seen corresponding path program 1 times [2023-12-16 03:56:03,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:56:03,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418077198] [2023-12-16 03:56:03,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:56:03,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:56:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:56:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:56:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:56:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:56:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:56:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:56:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:56:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:56:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:56:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:56:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:56:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:56:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:56:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:56:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,713 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 03:56:03,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:56:03,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418077198] [2023-12-16 03:56:03,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418077198] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:56:03,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:56:03,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 03:56:03,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230247419] [2023-12-16 03:56:03,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:56:03,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 03:56:03,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:56:03,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 03:56:03,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:56:03,720 INFO L87 Difference]: Start difference. First operand 71 states and 104 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 03:56:03,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:56:03,763 INFO L93 Difference]: Finished difference Result 143 states and 209 transitions. [2023-12-16 03:56:03,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 03:56:03,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 87 [2023-12-16 03:56:03,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:56:03,768 INFO L225 Difference]: With dead ends: 143 [2023-12-16 03:56:03,768 INFO L226 Difference]: Without dead ends: 73 [2023-12-16 03:56:03,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:56:03,772 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 12 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:56:03,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 88 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:56:03,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-16 03:56:03,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2023-12-16 03:56:03,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 43 states have internal predecessors, (51), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-16 03:56:03,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 103 transitions. [2023-12-16 03:56:03,785 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 103 transitions. Word has length 87 [2023-12-16 03:56:03,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:56:03,787 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 103 transitions. [2023-12-16 03:56:03,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 03:56:03,787 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 103 transitions. [2023-12-16 03:56:03,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-16 03:56:03,789 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:56:03,789 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:56:03,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 03:56:03,790 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:56:03,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:56:03,790 INFO L85 PathProgramCache]: Analyzing trace with hash -372840897, now seen corresponding path program 1 times [2023-12-16 03:56:03,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:56:03,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764169018] [2023-12-16 03:56:03,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:56:03,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:56:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:56:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:56:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:56:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:56:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:56:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:56:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:56:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:56:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:56:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:56:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:56:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:56:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:56:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:56:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:03,864 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 03:56:03,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:56:03,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764169018] [2023-12-16 03:56:03,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764169018] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:56:03,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:56:03,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 03:56:03,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314813431] [2023-12-16 03:56:03,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:56:03,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 03:56:03,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:56:03,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 03:56:03,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:56:03,873 INFO L87 Difference]: Start difference. First operand 71 states and 103 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 03:56:03,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:56:03,905 INFO L93 Difference]: Finished difference Result 138 states and 200 transitions. [2023-12-16 03:56:03,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 03:56:03,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 87 [2023-12-16 03:56:03,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:56:03,906 INFO L225 Difference]: With dead ends: 138 [2023-12-16 03:56:03,906 INFO L226 Difference]: Without dead ends: 68 [2023-12-16 03:56:03,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:56:03,907 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:56:03,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 95 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:56:03,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-16 03:56:03,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2023-12-16 03:56:03,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-16 03:56:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2023-12-16 03:56:03,913 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 87 [2023-12-16 03:56:03,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:56:03,913 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2023-12-16 03:56:03,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 03:56:03,914 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2023-12-16 03:56:03,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-16 03:56:03,914 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:56:03,914 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:56:03,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 03:56:03,915 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:56:03,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:56:03,915 INFO L85 PathProgramCache]: Analyzing trace with hash -256703579, now seen corresponding path program 1 times [2023-12-16 03:56:03,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:56:03,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018302584] [2023-12-16 03:56:03,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:56:03,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:56:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:56:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:56:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:56:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:56:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:56:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:56:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:56:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:56:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:56:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:56:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:56:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:56:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:56:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:56:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,328 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 03:56:04,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:56:04,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018302584] [2023-12-16 03:56:04,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018302584] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:56:04,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:56:04,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 03:56:04,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275609026] [2023-12-16 03:56:04,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:56:04,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 03:56:04,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:56:04,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 03:56:04,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 03:56:04,329 INFO L87 Difference]: Start difference. First operand 67 states and 96 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 03:56:04,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:56:04,444 INFO L93 Difference]: Finished difference Result 84 states and 115 transitions. [2023-12-16 03:56:04,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 03:56:04,445 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2023-12-16 03:56:04,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:56:04,446 INFO L225 Difference]: With dead ends: 84 [2023-12-16 03:56:04,446 INFO L226 Difference]: Without dead ends: 82 [2023-12-16 03:56:04,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-16 03:56:04,448 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 12 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:56:04,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 256 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:56:04,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-16 03:56:04,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2023-12-16 03:56:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 46 states have internal predecessors, (53), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-16 03:56:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2023-12-16 03:56:04,467 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 89 [2023-12-16 03:56:04,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:56:04,468 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2023-12-16 03:56:04,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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 03:56:04,468 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2023-12-16 03:56:04,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-16 03:56:04,472 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:56:04,472 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:56:04,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 03:56:04,472 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:56:04,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:56:04,472 INFO L85 PathProgramCache]: Analyzing trace with hash -254856537, now seen corresponding path program 1 times [2023-12-16 03:56:04,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:56:04,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003840272] [2023-12-16 03:56:04,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:56:04,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:56:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:56:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:56:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:56:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:56:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:56:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:56:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:56:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:56:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:56:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:56:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:56:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:56:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:56:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:56:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,881 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-12-16 03:56:04,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:56:04,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003840272] [2023-12-16 03:56:04,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003840272] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 03:56:04,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213050253] [2023-12-16 03:56:04,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:56:04,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:56:04,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:56:04,884 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 03:56:04,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 03:56:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:04,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-16 03:56:04,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 03:56:05,250 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 144 proven. 12 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2023-12-16 03:56:05,250 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 03:56:05,430 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-12-16 03:56:05,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213050253] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 03:56:05,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 03:56:05,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2023-12-16 03:56:05,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355117562] [2023-12-16 03:56:05,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 03:56:05,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 03:56:05,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:56:05,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 03:56:05,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-12-16 03:56:05,432 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-16 03:56:05,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:56:05,794 INFO L93 Difference]: Finished difference Result 137 states and 185 transitions. [2023-12-16 03:56:05,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-16 03:56:05,795 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 89 [2023-12-16 03:56:05,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:56:05,796 INFO L225 Difference]: With dead ends: 137 [2023-12-16 03:56:05,796 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 03:56:05,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 197 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2023-12-16 03:56:05,799 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 151 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 03:56:05,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 209 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 03:56:05,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 03:56:05,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 03:56:05,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 03:56:05,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 03:56:05,801 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2023-12-16 03:56:05,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:56:05,801 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 03:56:05,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-16 03:56:05,801 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 03:56:05,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 03:56:05,803 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 03:56:05,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-16 03:56:06,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-16 03:56:06,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 03:56:06,273 INFO L902 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: true [2023-12-16 03:56:06,273 INFO L902 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: true [2023-12-16 03:56:06,273 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-12-16 03:56:06,273 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (or (and (= ~var_1_1~0 ~var_1_8~0) (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256))) (and (= (mod ~var_1_7~0 256) 0) (= (mod ~var_1_1~0 256) 0))) [2023-12-16 03:56:06,273 INFO L895 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (or (and (= ~var_1_1~0 ~var_1_8~0) (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256))) (and (= (mod ~var_1_7~0 256) 0) (= (mod ~var_1_1~0 256) 0))) [2023-12-16 03:56:06,274 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-16 03:56:06,274 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-16 03:56:06,274 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-16 03:56:06,274 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-12-16 03:56:06,274 INFO L899 garLoopResultBuilder]: For program point L73-1(line 73) no Hoare annotation was computed. [2023-12-16 03:56:06,274 INFO L899 garLoopResultBuilder]: For program point L73-3(line 73) no Hoare annotation was computed. [2023-12-16 03:56:06,274 INFO L899 garLoopResultBuilder]: For program point L73-5(line 73) no Hoare annotation was computed. [2023-12-16 03:56:06,274 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-12-16 03:56:06,274 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 46) no Hoare annotation was computed. [2023-12-16 03:56:06,274 INFO L895 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (or (and (= ~var_1_1~0 ~var_1_8~0) (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256))) (and (= (mod ~var_1_7~0 256) 0) (= (mod ~var_1_1~0 256) 0))) [2023-12-16 03:56:06,274 INFO L895 garLoopResultBuilder]: At program point L61-1(line 61) the Hoare annotation is: (or (and (= ~var_1_1~0 ~var_1_8~0) (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256))) (and (= (mod ~var_1_7~0 256) 0) (= (mod ~var_1_1~0 256) 0))) [2023-12-16 03:56:06,274 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-16 03:56:06,274 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-12-16 03:56:06,274 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (or (and (= ~var_1_1~0 ~var_1_8~0) (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256))) (and (= (mod ~var_1_7~0 256) 0) (= (mod ~var_1_1~0 256) 0))) [2023-12-16 03:56:06,274 INFO L895 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (or (and (= ~var_1_1~0 ~var_1_8~0) (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256))) (and (= (mod ~var_1_7~0 256) 0) (= (mod ~var_1_1~0 256) 0))) [2023-12-16 03:56:06,274 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 45) no Hoare annotation was computed. [2023-12-16 03:56:06,274 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 03:56:06,275 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2023-12-16 03:56:06,275 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (or (and (= ~var_1_1~0 ~var_1_8~0) (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256))) (and (= (mod ~var_1_7~0 256) 0) (= (mod ~var_1_1~0 256) 0))) [2023-12-16 03:56:06,275 INFO L895 garLoopResultBuilder]: At program point L58-1(line 58) the Hoare annotation is: (or (and (= ~var_1_1~0 ~var_1_8~0) (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256))) (and (= (mod ~var_1_7~0 256) 0) (= (mod ~var_1_1~0 256) 0))) [2023-12-16 03:56:06,275 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-12-16 03:56:06,275 INFO L895 garLoopResultBuilder]: At program point L79-2(lines 79 85) the Hoare annotation is: (or (and (= ~var_1_1~0 ~var_1_8~0) (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256))) (and (= (mod ~var_1_7~0 256) 0) (= (mod ~var_1_1~0 256) 0) (<= (+ ~var_1_3~0 1) ~var_1_2~0))) [2023-12-16 03:56:06,275 INFO L899 garLoopResultBuilder]: For program point L79-3(lines 79 85) no Hoare annotation was computed. [2023-12-16 03:56:06,275 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 03:56:06,275 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256)) [2023-12-16 03:56:06,275 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256)) [2023-12-16 03:56:06,275 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2023-12-16 03:56:06,275 INFO L899 garLoopResultBuilder]: For program point L34-2(lines 34 42) no Hoare annotation was computed. [2023-12-16 03:56:06,275 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-12-16 03:56:06,275 INFO L895 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (or (and (= ~var_1_1~0 ~var_1_8~0) (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256))) (and (= (mod ~var_1_7~0 256) 0) (= (mod ~var_1_1~0 256) 0))) [2023-12-16 03:56:06,275 INFO L895 garLoopResultBuilder]: At program point L55-1(line 55) the Hoare annotation is: (or (and (= ~var_1_1~0 ~var_1_8~0) (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256))) (and (= (mod ~var_1_7~0 256) 0) (= (mod ~var_1_1~0 256) 0))) [2023-12-16 03:56:06,275 INFO L899 garLoopResultBuilder]: For program point L68(lines 47 69) no Hoare annotation was computed. [2023-12-16 03:56:06,275 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 39) no Hoare annotation was computed. [2023-12-16 03:56:06,275 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-16 03:56:06,276 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-16 03:56:06,276 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-16 03:56:06,276 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-16 03:56:06,278 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-16 03:56:06,279 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 03:56:06,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:56:06 BoogieIcfgContainer [2023-12-16 03:56:06,286 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 03:56:06,286 INFO L158 Benchmark]: Toolchain (without parser) took 4280.89ms. Allocated memory was 224.4MB in the beginning and 291.5MB in the end (delta: 67.1MB). Free memory was 182.8MB in the beginning and 93.4MB in the end (delta: 89.4MB). Peak memory consumption was 157.7MB. Max. memory is 8.0GB. [2023-12-16 03:56:06,286 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 224.4MB. Free memory is still 177.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 03:56:06,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.24ms. Allocated memory is still 224.4MB. Free memory was 182.4MB in the beginning and 170.5MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 03:56:06,287 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.43ms. Allocated memory is still 224.4MB. Free memory was 170.5MB in the beginning and 168.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 03:56:06,287 INFO L158 Benchmark]: Boogie Preprocessor took 35.83ms. Allocated memory is still 224.4MB. Free memory was 168.5MB in the beginning and 166.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 03:56:06,287 INFO L158 Benchmark]: RCFGBuilder took 339.71ms. Allocated memory is still 224.4MB. Free memory was 166.4MB in the beginning and 151.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 03:56:06,287 INFO L158 Benchmark]: TraceAbstraction took 3672.43ms. Allocated memory was 224.4MB in the beginning and 291.5MB in the end (delta: 67.1MB). Free memory was 151.0MB in the beginning and 93.4MB in the end (delta: 57.6MB). Peak memory consumption was 126.3MB. Max. memory is 8.0GB. [2023-12-16 03:56:06,288 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.48ms. Allocated memory is still 224.4MB. Free memory is still 177.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 196.24ms. Allocated memory is still 224.4MB. Free memory was 182.4MB in the beginning and 170.5MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.43ms. Allocated memory is still 224.4MB. Free memory was 170.5MB in the beginning and 168.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.83ms. Allocated memory is still 224.4MB. Free memory was 168.5MB in the beginning and 166.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 339.71ms. Allocated memory is still 224.4MB. Free memory was 166.4MB in the beginning and 151.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 3672.43ms. Allocated memory was 224.4MB in the beginning and 291.5MB in the end (delta: 67.1MB). Free memory was 151.0MB in the beginning and 93.4MB in the end (delta: 57.6MB). Peak memory consumption was 126.3MB. 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, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 255 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 225 mSDsluCounter, 912 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 604 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 446 IncrementalHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 308 mSDtfsCounter, 446 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 405 GetRequests, 363 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=5, InterpolantAutomatonStates: 41, 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, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 127 PreInvPairs, 177 NumberOfFragments, 275 HoareAnnotationTreeSize, 127 FormulaSimplifications, 218 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FormulaSimplificationsInter, 399 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 611 NumberOfCodeBlocks, 611 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 692 ConstructedInterpolants, 0 QuantifiedInterpolants, 1329 SizeOfPredicates, 17 NumberOfNonLiveVariables, 211 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 2888/2912 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: 79]: Loop Invariant Derived loop invariant: (((var_1_1 == var_1_8) && (var_1_7 == ((var_1_7 / 256) * 256))) || ((((var_1_7 % 256) == 0) && ((var_1_1 % 256) == 0)) && ((var_1_3 + 1) <= var_1_2))) RESULT: Ultimate proved your program to be correct! [2023-12-16 03:56:06,311 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...