/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-32.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 10:46:13,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 10:46:13,527 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-19 10:46:13,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 10:46:13,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 10:46:13,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 10:46:13,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 10:46:13,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 10:46:13,563 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 10:46:13,566 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 10:46:13,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 10:46:13,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 10:46:13,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 10:46:13,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 10:46:13,570 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 10:46:13,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 10:46:13,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 10:46:13,570 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 10:46:13,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 10:46:13,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 10:46:13,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 10:46:13,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 10:46:13,572 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 10:46:13,572 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 10:46:13,572 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 10:46:13,572 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 10:46:13,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 10:46:13,573 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 10:46:13,573 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 10:46:13,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 10:46:13,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 10:46:13,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 10:46:13,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 10:46:13,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 10:46:13,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 10:46:13,576 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 10:46:13,576 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 10:46:13,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 10:46:13,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 10:46:13,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 10:46:13,577 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 10:46:13,577 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 10:46:13,577 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 10:46:13,577 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 10:46:13,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 10:46:13,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 10:46:13,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 10:46:13,857 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 10:46:13,858 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 10:46:13,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-32.i [2023-12-19 10:46:15,129 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 10:46:15,343 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 10:46:15,343 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-32.i [2023-12-19 10:46:15,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8bfe19cd/e83d517d0c5a49a495ec4d4c20b2abd1/FLAG108a1920d [2023-12-19 10:46:15,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8bfe19cd/e83d517d0c5a49a495ec4d4c20b2abd1 [2023-12-19 10:46:15,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 10:46:15,370 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 10:46:15,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 10:46:15,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 10:46:15,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 10:46:15,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 10:46:15" (1/1) ... [2023-12-19 10:46:15,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fe7a7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:15, skipping insertion in model container [2023-12-19 10:46:15,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 10:46:15" (1/1) ... [2023-12-19 10:46:15,401 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 10:46:15,550 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_floatingpointinfluence_no-floats_file-32.i[916,929] [2023-12-19 10:46:15,590 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 10:46:15,601 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 10:46:15,610 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_floatingpointinfluence_no-floats_file-32.i[916,929] [2023-12-19 10:46:15,644 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 10:46:15,662 INFO L206 MainTranslator]: Completed translation [2023-12-19 10:46:15,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:15 WrapperNode [2023-12-19 10:46:15,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 10:46:15,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 10:46:15,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 10:46:15,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 10:46:15,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:15" (1/1) ... [2023-12-19 10:46:15,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:15" (1/1) ... [2023-12-19 10:46:15,724 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2023-12-19 10:46:15,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 10:46:15,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 10:46:15,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 10:46:15,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 10:46:15,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:15" (1/1) ... [2023-12-19 10:46:15,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:15" (1/1) ... [2023-12-19 10:46:15,737 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:15" (1/1) ... [2023-12-19 10:46:15,757 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-19 10:46:15,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:15" (1/1) ... [2023-12-19 10:46:15,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:15" (1/1) ... [2023-12-19 10:46:15,764 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:15" (1/1) ... [2023-12-19 10:46:15,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:15" (1/1) ... [2023-12-19 10:46:15,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:15" (1/1) ... [2023-12-19 10:46:15,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:15" (1/1) ... [2023-12-19 10:46:15,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 10:46:15,776 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 10:46:15,776 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 10:46:15,776 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 10:46:15,777 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:15" (1/1) ... [2023-12-19 10:46:15,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 10:46:15,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 10:46:15,815 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-19 10:46:15,852 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-19 10:46:15,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 10:46:15,859 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 10:46:15,859 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 10:46:15,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 10:46:15,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 10:46:15,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 10:46:15,963 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 10:46:15,965 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 10:46:16,233 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 10:46:16,275 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 10:46:16,276 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 10:46:16,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 10:46:16 BoogieIcfgContainer [2023-12-19 10:46:16,276 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 10:46:16,278 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 10:46:16,278 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 10:46:16,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 10:46:16,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 10:46:15" (1/3) ... [2023-12-19 10:46:16,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652e8f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 10:46:16, skipping insertion in model container [2023-12-19 10:46:16,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:15" (2/3) ... [2023-12-19 10:46:16,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652e8f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 10:46:16, skipping insertion in model container [2023-12-19 10:46:16,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 10:46:16" (3/3) ... [2023-12-19 10:46:16,286 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-32.i [2023-12-19 10:46:16,327 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 10:46:16,327 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 10:46:16,384 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 10:46:16,392 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;@b874806, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 10:46:16,392 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 10:46:16,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-19 10:46:16,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-19 10:46:16,423 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:46:16,424 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 10:46:16,424 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:46:16,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:46:16,434 INFO L85 PathProgramCache]: Analyzing trace with hash 887830059, now seen corresponding path program 1 times [2023-12-19 10:46:16,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:46:16,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212804726] [2023-12-19 10:46:16,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:46:16,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:46:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:16,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:46:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:16,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:46:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:16,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:46:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:16,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:46:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:16,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:46:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:17,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:46:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:17,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:46:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:17,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:46:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:17,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:46:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:17,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:46:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:17,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:46:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:17,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:46:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:17,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:46:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:17,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:46:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:17,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:46:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:17,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 10:46:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:17,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:46:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:17,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 10:46:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:17,134 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 10:46:17,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:46:17,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212804726] [2023-12-19 10:46:17,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212804726] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:46:17,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:46:17,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 10:46:17,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874474216] [2023-12-19 10:46:17,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:46:17,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 10:46:17,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:46:17,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 10:46:17,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 10:46:17,176 INFO L87 Difference]: Start difference. First operand has 49 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 10:46:17,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:46:17,355 INFO L93 Difference]: Finished difference Result 95 states and 168 transitions. [2023-12-19 10:46:17,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 10:46:17,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 109 [2023-12-19 10:46:17,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:46:17,371 INFO L225 Difference]: With dead ends: 95 [2023-12-19 10:46:17,371 INFO L226 Difference]: Without dead ends: 47 [2023-12-19 10:46:17,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 10:46:17,380 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 10:46:17,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 65 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 10:46:17,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-19 10:46:17,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-12-19 10:46:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-19 10:46:17,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 70 transitions. [2023-12-19 10:46:17,436 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 70 transitions. Word has length 109 [2023-12-19 10:46:17,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:46:17,439 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 70 transitions. [2023-12-19 10:46:17,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 10:46:17,439 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 70 transitions. [2023-12-19 10:46:17,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-19 10:46:17,446 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:46:17,446 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 10:46:17,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 10:46:17,446 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:46:17,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:46:17,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1697176685, now seen corresponding path program 1 times [2023-12-19 10:46:17,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:46:17,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36528921] [2023-12-19 10:46:17,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:46:17,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:46:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:23,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:46:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:23,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:46:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:23,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:46:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:23,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:46:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:23,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:46:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:23,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:46:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:23,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:46:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:23,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:46:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:23,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:46:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:23,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:46:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:23,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:46:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:23,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:46:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:23,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:46:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:23,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:46:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:23,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:46:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:23,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 10:46:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:23,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:46:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:23,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 10:46:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:23,926 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 10:46:23,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:46:23,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36528921] [2023-12-19 10:46:23,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36528921] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:46:23,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:46:23,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 10:46:23,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772427549] [2023-12-19 10:46:23,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:46:23,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 10:46:23,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:46:23,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 10:46:23,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-19 10:46:23,930 INFO L87 Difference]: Start difference. First operand 47 states and 70 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-12-19 10:46:26,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:46:26,304 INFO L93 Difference]: Finished difference Result 151 states and 213 transitions. [2023-12-19 10:46:26,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-19 10:46:26,305 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 109 [2023-12-19 10:46:26,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:46:26,307 INFO L225 Difference]: With dead ends: 151 [2023-12-19 10:46:26,308 INFO L226 Difference]: Without dead ends: 149 [2023-12-19 10:46:26,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=271, Invalid=851, Unknown=0, NotChecked=0, Total=1122 [2023-12-19 10:46:26,310 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 203 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 10:46:26,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 328 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 10:46:26,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-12-19 10:46:26,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 73. [2023-12-19 10:46:26,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 10:46:26,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 106 transitions. [2023-12-19 10:46:26,344 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 106 transitions. Word has length 109 [2023-12-19 10:46:26,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:46:26,345 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 106 transitions. [2023-12-19 10:46:26,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-12-19 10:46:26,345 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2023-12-19 10:46:26,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-19 10:46:26,347 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:46:26,347 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 10:46:26,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 10:46:26,347 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:46:26,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:46:26,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1057797391, now seen corresponding path program 1 times [2023-12-19 10:46:26,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:46:26,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384528623] [2023-12-19 10:46:26,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:46:26,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:46:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:29,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:46:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:29,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:46:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:29,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:46:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:29,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:46:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:29,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:46:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:29,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:46:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:29,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:46:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:29,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:46:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:29,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:46:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:29,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:46:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:29,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:46:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:29,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:46:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:29,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:46:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:29,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:46:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:29,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:46:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:29,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 10:46:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:29,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:46:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:29,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 10:46:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:29,993 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 10:46:29,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:46:29,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384528623] [2023-12-19 10:46:29,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384528623] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:46:29,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:46:29,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 10:46:29,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567072696] [2023-12-19 10:46:29,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:46:29,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 10:46:29,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:46:29,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 10:46:29,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-19 10:46:29,996 INFO L87 Difference]: Start difference. First operand 73 states and 106 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 10:46:30,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:46:30,533 INFO L93 Difference]: Finished difference Result 92 states and 128 transitions. [2023-12-19 10:46:30,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-19 10:46:30,534 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 110 [2023-12-19 10:46:30,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:46:30,537 INFO L225 Difference]: With dead ends: 92 [2023-12-19 10:46:30,537 INFO L226 Difference]: Without dead ends: 90 [2023-12-19 10:46:30,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2023-12-19 10:46:30,538 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 47 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 10:46:30,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 255 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 10:46:30,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-19 10:46:30,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2023-12-19 10:46:30,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 48 states have internal predecessors, (60), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 10:46:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 108 transitions. [2023-12-19 10:46:30,554 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 108 transitions. Word has length 110 [2023-12-19 10:46:30,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:46:30,555 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 108 transitions. [2023-12-19 10:46:30,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 10:46:30,555 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 108 transitions. [2023-12-19 10:46:30,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-19 10:46:30,557 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:46:30,557 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 10:46:30,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 10:46:30,558 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:46:30,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:46:30,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1577699368, now seen corresponding path program 1 times [2023-12-19 10:46:30,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:46:30,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924071483] [2023-12-19 10:46:30,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:46:30,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:46:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:35,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:46:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:35,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:46:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:35,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:46:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:35,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:46:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:35,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:46:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:35,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:46:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:35,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:46:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:35,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:46:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:35,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:46:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:35,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:46:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:35,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:46:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:35,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:46:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:35,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:46:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:35,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:46:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:35,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:46:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:35,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 10:46:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:35,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:46:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:35,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 10:46:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:35,470 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 10:46:35,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:46:35,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924071483] [2023-12-19 10:46:35,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924071483] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:46:35,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:46:35,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 10:46:35,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387493871] [2023-12-19 10:46:35,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:46:35,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 10:46:35,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:46:35,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 10:46:35,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-19 10:46:35,473 INFO L87 Difference]: Start difference. First operand 74 states and 108 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 10:46:36,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:46:36,439 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2023-12-19 10:46:36,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 10:46:36,439 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2023-12-19 10:46:36,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:46:36,441 INFO L225 Difference]: With dead ends: 88 [2023-12-19 10:46:36,441 INFO L226 Difference]: Without dead ends: 86 [2023-12-19 10:46:36,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2023-12-19 10:46:36,442 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 66 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 10:46:36,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 212 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 10:46:36,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-19 10:46:36,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2023-12-19 10:46:36,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 47 states have internal predecessors, (59), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 10:46:36,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 107 transitions. [2023-12-19 10:46:36,457 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 107 transitions. Word has length 111 [2023-12-19 10:46:36,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:46:36,458 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 107 transitions. [2023-12-19 10:46:36,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 10:46:36,458 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 107 transitions. [2023-12-19 10:46:36,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-19 10:46:36,460 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:46:36,460 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 10:46:36,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 10:46:36,460 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:46:36,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:46:36,461 INFO L85 PathProgramCache]: Analyzing trace with hash 958873527, now seen corresponding path program 1 times [2023-12-19 10:46:36,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:46:36,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367291898] [2023-12-19 10:46:36,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:46:36,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:46:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:37,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:46:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:37,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:46:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:37,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:46:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:37,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:46:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:37,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:46:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:37,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:46:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:37,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:46:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:37,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:46:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:37,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:46:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:37,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:46:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:37,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:46:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:37,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:46:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:37,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:46:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:37,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:46:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:37,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:46:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:37,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 10:46:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:37,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:46:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:37,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 10:46:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:37,938 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 10:46:37,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:46:37,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367291898] [2023-12-19 10:46:37,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367291898] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:46:37,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:46:37,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 10:46:37,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446820607] [2023-12-19 10:46:37,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:46:37,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 10:46:37,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:46:37,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 10:46:37,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-19 10:46:37,941 INFO L87 Difference]: Start difference. First operand 73 states and 107 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 10:46:38,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:46:38,570 INFO L93 Difference]: Finished difference Result 166 states and 238 transitions. [2023-12-19 10:46:38,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-19 10:46:38,571 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2023-12-19 10:46:38,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:46:38,572 INFO L225 Difference]: With dead ends: 166 [2023-12-19 10:46:38,572 INFO L226 Difference]: Without dead ends: 94 [2023-12-19 10:46:38,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2023-12-19 10:46:38,574 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 70 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 10:46:38,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 195 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 10:46:38,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-19 10:46:38,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2023-12-19 10:46:38,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 49 states have internal predecessors, (61), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 10:46:38,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2023-12-19 10:46:38,590 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 111 [2023-12-19 10:46:38,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:46:38,590 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2023-12-19 10:46:38,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 10:46:38,591 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2023-12-19 10:46:38,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-19 10:46:38,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:46:38,592 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 10:46:38,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 10:46:38,593 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:46:38,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:46:38,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1016131829, now seen corresponding path program 1 times [2023-12-19 10:46:38,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:46:38,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537377657] [2023-12-19 10:46:38,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:46:38,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:46:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:41,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:46:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:41,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:46:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:41,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:46:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:41,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:46:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:41,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:46:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:41,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:46:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:41,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:46:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:41,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:46:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:41,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:46:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:41,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:46:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:41,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:46:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:41,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:46:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:41,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:46:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:41,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:46:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:41,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:46:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:41,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 10:46:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:41,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:46:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:41,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 10:46:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 10:46:41,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:46:41,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537377657] [2023-12-19 10:46:41,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537377657] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:46:41,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:46:41,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 10:46:41,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865337958] [2023-12-19 10:46:41,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:46:41,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 10:46:41,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:46:41,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 10:46:41,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-19 10:46:41,327 INFO L87 Difference]: Start difference. First operand 75 states and 109 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 10:46:41,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:46:41,819 INFO L93 Difference]: Finished difference Result 102 states and 137 transitions. [2023-12-19 10:46:41,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 10:46:41,820 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2023-12-19 10:46:41,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:46:41,821 INFO L225 Difference]: With dead ends: 102 [2023-12-19 10:46:41,821 INFO L226 Difference]: Without dead ends: 100 [2023-12-19 10:46:41,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2023-12-19 10:46:41,822 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 41 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 10:46:41,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 216 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 10:46:41,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-19 10:46:41,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 73. [2023-12-19 10:46:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 10:46:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 106 transitions. [2023-12-19 10:46:41,858 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 106 transitions. Word has length 111 [2023-12-19 10:46:41,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:46:41,859 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 106 transitions. [2023-12-19 10:46:41,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 10:46:41,859 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2023-12-19 10:46:41,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-19 10:46:41,861 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:46:41,861 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 10:46:41,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 10:46:41,862 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:46:41,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:46:41,862 INFO L85 PathProgramCache]: Analyzing trace with hash -354764027, now seen corresponding path program 1 times [2023-12-19 10:46:41,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:46:41,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716463971] [2023-12-19 10:46:41,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:46:41,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:46:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:43,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:46:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:43,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:46:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:43,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:46:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:43,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:46:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:43,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:46:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:43,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:46:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:43,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:46:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:43,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:46:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:43,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:46:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:43,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:46:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:43,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:46:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:43,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:46:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:43,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:46:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:43,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:46:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:43,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:46:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:43,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 10:46:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:43,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:46:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:43,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 10:46:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:43,156 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 10:46:43,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:46:43,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716463971] [2023-12-19 10:46:43,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716463971] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:46:43,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:46:43,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 10:46:43,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148238093] [2023-12-19 10:46:43,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:46:43,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 10:46:43,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:46:43,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 10:46:43,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-19 10:46:43,158 INFO L87 Difference]: Start difference. First operand 73 states and 106 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 10:46:44,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:46:44,514 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2023-12-19 10:46:44,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-19 10:46:44,515 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2023-12-19 10:46:44,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:46:44,516 INFO L225 Difference]: With dead ends: 90 [2023-12-19 10:46:44,516 INFO L226 Difference]: Without dead ends: 88 [2023-12-19 10:46:44,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2023-12-19 10:46:44,517 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 67 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 10:46:44,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 383 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 10:46:44,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-19 10:46:44,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 73. [2023-12-19 10:46:44,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 10:46:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 106 transitions. [2023-12-19 10:46:44,530 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 106 transitions. Word has length 112 [2023-12-19 10:46:44,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:46:44,531 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 106 transitions. [2023-12-19 10:46:44,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 10:46:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2023-12-19 10:46:44,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 10:46:44,532 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:46:44,532 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 10:46:44,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 10:46:44,533 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:46:44,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:46:44,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1877596512, now seen corresponding path program 1 times [2023-12-19 10:46:44,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:46:44,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691710418] [2023-12-19 10:46:44,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:46:44,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:46:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:48,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:46:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:48,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:46:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:48,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:46:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:48,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:46:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:48,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:46:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:48,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:46:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:48,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:46:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:48,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:46:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:48,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:46:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:48,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:46:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:48,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:46:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:48,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:46:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:48,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:46:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:48,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:46:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:48,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:46:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:48,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 10:46:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:48,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:46:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:48,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 10:46:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:48,029 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 10:46:48,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:46:48,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691710418] [2023-12-19 10:46:48,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691710418] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:46:48,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:46:48,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 10:46:48,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356823135] [2023-12-19 10:46:48,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:46:48,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 10:46:48,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:46:48,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 10:46:48,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-12-19 10:46:48,032 INFO L87 Difference]: Start difference. First operand 73 states and 106 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 10:46:48,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:46:48,465 INFO L93 Difference]: Finished difference Result 88 states and 121 transitions. [2023-12-19 10:46:48,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 10:46:48,466 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2023-12-19 10:46:48,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:46:48,466 INFO L225 Difference]: With dead ends: 88 [2023-12-19 10:46:48,467 INFO L226 Difference]: Without dead ends: 0 [2023-12-19 10:46:48,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2023-12-19 10:46:48,468 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 28 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 10:46:48,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 214 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 10:46:48,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-19 10:46:48,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-19 10:46:48,469 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-19 10:46:48,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-19 10:46:48,469 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2023-12-19 10:46:48,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:46:48,470 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-19 10:46:48,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 10:46:48,470 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-19 10:46:48,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-19 10:46:48,472 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 10:46:48,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 10:46:48,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-19 10:52:05,794 WARN L293 SmtUtils]: Spent 5.29m on a formula simplification. DAG size of input: 251 DAG size of output: 537 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-19 10:52:09,115 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-19 10:52:09,115 INFO L895 garLoopResultBuilder]: At program point L85-1(line 85) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-19 10:52:09,115 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-19 10:52:09,115 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-19 10:52:09,115 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-19 10:52:09,115 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-12-19 10:52:09,115 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2023-12-19 10:52:09,115 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 63) no Hoare annotation was computed. [2023-12-19 10:52:09,116 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-19 10:52:09,116 INFO L895 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-19 10:52:09,116 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 64) no Hoare annotation was computed. [2023-12-19 10:52:09,116 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 60) no Hoare annotation was computed. [2023-12-19 10:52:09,116 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-19 10:52:09,116 INFO L895 garLoopResultBuilder]: At program point L79-1(line 79) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-19 10:52:09,116 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 48) no Hoare annotation was computed. [2023-12-19 10:52:09,116 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-19 10:52:09,116 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-12-19 10:52:09,116 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2023-12-19 10:52:09,116 INFO L895 garLoopResultBuilder]: At program point L104-2(lines 104 110) the Hoare annotation is: (let ((.cse0 (<= 0 ~last_1_var_1_6~0))) (or (and (= ~var_1_6~0 0) .cse0) (and (let ((.cse4 (* (div ~var_1_5~0 65536) 65536))) (let ((.cse3 (+ .cse4 ~var_1_4~0 ~var_1_3~0)) (.cse1 (* (div ~var_1_4~0 65536) 65536)) (.cse2 (* (div ~var_1_3~0 65536) 65536))) (or (and (= (+ .cse1 .cse2 ~var_1_1~0) (+ ~var_1_4~0 ~var_1_3~0)) (<= (+ .cse1 .cse2 ~var_1_5~0 1) .cse3)) (and (<= .cse3 (+ .cse1 .cse2 ~var_1_5~0)) (= (+ .cse4 ~var_1_1~0) ~var_1_5~0))))) .cse0 (<= 0 ~var_1_6~0)))) [2023-12-19 10:52:09,117 INFO L899 garLoopResultBuilder]: For program point L104-3(lines 104 110) no Hoare annotation was computed. [2023-12-19 10:52:09,117 INFO L899 garLoopResultBuilder]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2023-12-19 10:52:09,117 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-19 10:52:09,117 INFO L895 garLoopResultBuilder]: At program point L88-1(line 88) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-19 10:52:09,117 INFO L899 garLoopResultBuilder]: For program point L55(lines 55 57) no Hoare annotation was computed. [2023-12-19 10:52:09,117 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-12-19 10:52:09,117 INFO L899 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed. [2023-12-19 10:52:09,117 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-19 10:52:09,117 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-19 10:52:09,117 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-19 10:52:09,118 INFO L895 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-19 10:52:09,118 INFO L895 garLoopResultBuilder]: At program point L82-1(line 82) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-19 10:52:09,118 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-12-19 10:52:09,118 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-19 10:52:09,118 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-19 10:52:09,118 INFO L895 garLoopResultBuilder]: At program point L91-1(line 91) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-19 10:52:09,118 INFO L899 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2023-12-19 10:52:09,118 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 50) no Hoare annotation was computed. [2023-12-19 10:52:09,118 INFO L899 garLoopResultBuilder]: For program point L42-1(lines 42 50) no Hoare annotation was computed. [2023-12-19 10:52:09,118 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-19 10:52:09,118 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-19 10:52:09,119 INFO L899 garLoopResultBuilder]: For program point L92(lines 65 93) no Hoare annotation was computed. [2023-12-19 10:52:09,119 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-19 10:52:09,119 INFO L895 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-19 10:52:09,119 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 49) no Hoare annotation was computed. [2023-12-19 10:52:09,119 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-12-19 10:52:09,119 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-19 10:52:09,119 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-19 10:52:09,119 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-19 10:52:09,119 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-19 10:52:09,122 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:52:09,124 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 10:52:09,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 10:52:09 BoogieIcfgContainer [2023-12-19 10:52:09,135 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 10:52:09,136 INFO L158 Benchmark]: Toolchain (without parser) took 353765.67ms. Allocated memory was 184.5MB in the beginning and 695.2MB in the end (delta: 510.7MB). Free memory was 135.4MB in the beginning and 349.4MB in the end (delta: -213.9MB). Peak memory consumption was 400.2MB. Max. memory is 8.0GB. [2023-12-19 10:52:09,136 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 184.5MB. Free memory is still 132.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 10:52:09,136 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.83ms. Allocated memory is still 184.5MB. Free memory was 135.4MB in the beginning and 122.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-19 10:52:09,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.44ms. Allocated memory is still 184.5MB. Free memory was 122.5MB in the beginning and 119.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 10:52:09,137 INFO L158 Benchmark]: Boogie Preprocessor took 49.69ms. Allocated memory is still 184.5MB. Free memory was 119.4MB in the beginning and 114.8MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 10:52:09,137 INFO L158 Benchmark]: RCFGBuilder took 500.43ms. Allocated memory is still 184.5MB. Free memory was 114.8MB in the beginning and 95.3MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-19 10:52:09,137 INFO L158 Benchmark]: TraceAbstraction took 352857.33ms. Allocated memory was 184.5MB in the beginning and 695.2MB in the end (delta: 510.7MB). Free memory was 94.5MB in the beginning and 349.4MB in the end (delta: -254.8MB). Peak memory consumption was 359.3MB. Max. memory is 8.0GB. [2023-12-19 10:52:09,138 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.57ms. Allocated memory is still 184.5MB. Free memory is still 132.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 291.83ms. Allocated memory is still 184.5MB. Free memory was 135.4MB in the beginning and 122.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.44ms. Allocated memory is still 184.5MB. Free memory was 122.5MB in the beginning and 119.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.69ms. Allocated memory is still 184.5MB. Free memory was 119.4MB in the beginning and 114.8MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 500.43ms. Allocated memory is still 184.5MB. Free memory was 114.8MB in the beginning and 95.3MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 352857.33ms. Allocated memory was 184.5MB in the beginning and 695.2MB in the end (delta: 510.7MB). Free memory was 94.5MB in the beginning and 349.4MB in the end (delta: -254.8MB). Peak memory consumption was 359.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, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 352.8s, OverallIterations: 8, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 320.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 576 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 576 mSDsluCounter, 1868 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1382 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1197 IncrementalHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 486 mSDtfsCounter, 1197 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 438 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=5, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 166 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 85 PreInvPairs, 116 NumberOfFragments, 213 HoareAnnotationTreeSize, 85 FormulaSimplifications, 15892937 FormulaSimplificationTreeSizeReduction, 317.3s HoareSimplificationTime, 20 FormulaSimplificationsInter, 452452 FormulaSimplificationTreeSizeReductionInter, 3.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 24.2s InterpolantComputationTime, 886 NumberOfCodeBlocks, 886 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 878 ConstructedInterpolants, 0 QuantifiedInterpolants, 10622 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 4896/4896 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: 104]: Loop Invariant Derived loop invariant: (((var_1_6 == 0) && (0 <= last_1_var_1_6)) || (((((((((var_1_4 / 65536) * 65536) + ((var_1_3 / 65536) * 65536)) + var_1_1) == (var_1_4 + var_1_3)) && ((((((var_1_4 / 65536) * 65536) + ((var_1_3 / 65536) * 65536)) + var_1_5) + 1) <= ((((var_1_5 / 65536) * 65536) + var_1_4) + var_1_3))) || ((((((var_1_5 / 65536) * 65536) + var_1_4) + var_1_3) <= ((((var_1_4 / 65536) * 65536) + ((var_1_3 / 65536) * 65536)) + var_1_5)) && ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5))) && (0 <= last_1_var_1_6)) && (0 <= var_1_6))) RESULT: Ultimate proved your program to be correct! [2023-12-19 10:52:09,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...