/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-88.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 20:44:53,811 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 20:44:53,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 20:44:53,850 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 20:44:53,850 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 20:44:53,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 20:44:53,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 20:44:53,866 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 20:44:53,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 20:44:53,866 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 20:44:53,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 20:44:53,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 20:44:53,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 20:44:53,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 20:44:53,871 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 20:44:53,872 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 20:44:53,873 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 20:44:53,875 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 20:44:53,875 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 20:44:53,876 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 20:44:53,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 20:44:53,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 20:44:53,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 20:44:53,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 20:44:53,877 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 20:44:53,877 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 20:44:53,878 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 20:44:53,878 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 20:44:53,878 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 20:44:53,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 20:44:53,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 20:44:53,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 20:44:53,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:44:53,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 20:44:53,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 20:44:53,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 20:44:53,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 20:44:53,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 20:44:53,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 20:44:53,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 20:44:53,881 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 20:44:53,881 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 20:44:53,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 20:44:53,881 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 20:44:54,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 20:44:54,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 20:44:54,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 20:44:54,050 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 20:44:54,050 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 20:44:54,051 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-88.i [2023-12-15 20:44:55,038 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 20:44:55,220 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 20:44:55,221 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i [2023-12-15 20:44:55,229 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ed6ea97/16dbf73a533d4402920dccc169d3f5cc/FLAG210f1150a [2023-12-15 20:44:55,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ed6ea97/16dbf73a533d4402920dccc169d3f5cc [2023-12-15 20:44:55,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 20:44:55,632 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 20:44:55,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 20:44:55,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 20:44:55,640 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 20:44:55,641 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:44:55" (1/1) ... [2023-12-15 20:44:55,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c839e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:55, skipping insertion in model container [2023-12-15 20:44:55,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:44:55" (1/1) ... [2023-12-15 20:44:55,677 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 20:44:55,776 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-88.i[916,929] [2023-12-15 20:44:55,799 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:44:55,807 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 20:44:55,816 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-88.i[916,929] [2023-12-15 20:44:55,836 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:44:55,854 INFO L206 MainTranslator]: Completed translation [2023-12-15 20:44:55,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:55 WrapperNode [2023-12-15 20:44:55,854 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 20:44:55,855 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 20:44:55,855 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 20:44:55,855 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 20:44:55,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:55" (1/1) ... [2023-12-15 20:44:55,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:55" (1/1) ... [2023-12-15 20:44:55,886 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2023-12-15 20:44:55,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 20:44:55,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 20:44:55,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 20:44:55,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 20:44:55,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:55" (1/1) ... [2023-12-15 20:44:55,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:55" (1/1) ... [2023-12-15 20:44:55,897 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:55" (1/1) ... [2023-12-15 20:44:55,905 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 20:44:55,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:55" (1/1) ... [2023-12-15 20:44:55,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:55" (1/1) ... [2023-12-15 20:44:55,909 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:55" (1/1) ... [2023-12-15 20:44:55,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:55" (1/1) ... [2023-12-15 20:44:55,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:55" (1/1) ... [2023-12-15 20:44:55,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:55" (1/1) ... [2023-12-15 20:44:55,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 20:44:55,915 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 20:44:55,915 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 20:44:55,915 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 20:44:55,916 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:55" (1/1) ... [2023-12-15 20:44:55,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:44:55,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:44:55,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 20:44:55,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 20:44:55,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 20:44:55,994 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 20:44:55,994 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 20:44:55,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 20:44:55,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 20:44:55,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 20:44:56,059 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 20:44:56,061 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 20:44:56,269 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 20:44:56,310 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 20:44:56,310 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 20:44:56,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:44:56 BoogieIcfgContainer [2023-12-15 20:44:56,310 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 20:44:56,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 20:44:56,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 20:44:56,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 20:44:56,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:44:55" (1/3) ... [2023-12-15 20:44:56,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb673f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:44:56, skipping insertion in model container [2023-12-15 20:44:56,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:44:55" (2/3) ... [2023-12-15 20:44:56,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb673f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:44:56, skipping insertion in model container [2023-12-15 20:44:56,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:44:56" (3/3) ... [2023-12-15 20:44:56,316 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-88.i [2023-12-15 20:44:56,327 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 20:44:56,327 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 20:44:56,358 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 20:44:56,363 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;@c5a1ea8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 20:44:56,363 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 20:44:56,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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-15 20:44:56,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-15 20:44:56,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:44:56,377 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-15 20:44:56,377 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:44:56,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:44:56,381 INFO L85 PathProgramCache]: Analyzing trace with hash 626528525, now seen corresponding path program 1 times [2023-12-15 20:44:56,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:44:56,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287010307] [2023-12-15 20:44:56,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:44:56,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:44:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:56,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:44:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:56,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:44:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:56,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:44:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:56,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:44:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:56,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:44:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:56,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:44:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:56,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:44:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:56,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:44:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:56,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:44:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:56,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:44:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:56,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:44:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:56,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:44:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:56,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:44:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:56,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:44:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:56,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:44:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:56,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:44:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:56,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:44:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:56,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:44:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:56,603 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-15 20:44:56,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:44:56,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287010307] [2023-12-15 20:44:56,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287010307] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:44:56,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:44:56,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 20:44:56,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141805491] [2023-12-15 20:44:56,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:44:56,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 20:44:56,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:44:56,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 20:44:56,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:44:56,629 INFO L87 Difference]: Start difference. First operand has 51 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-15 20:44:56,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:44:56,666 INFO L93 Difference]: Finished difference Result 99 states and 176 transitions. [2023-12-15 20:44:56,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 20:44:56,668 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 112 [2023-12-15 20:44:56,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:44:56,675 INFO L225 Difference]: With dead ends: 99 [2023-12-15 20:44:56,676 INFO L226 Difference]: Without dead ends: 49 [2023-12-15 20:44:56,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:44:56,684 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:44:56,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:44:56,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-15 20:44:56,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-15 20:44:56,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 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-15 20:44:56,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2023-12-15 20:44:56,732 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 112 [2023-12-15 20:44:56,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:44:56,733 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2023-12-15 20:44:56,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-15 20:44:56,733 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2023-12-15 20:44:56,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-15 20:44:56,735 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:44:56,735 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-15 20:44:56,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 20:44:56,735 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:44:56,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:44:56,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1281864269, now seen corresponding path program 1 times [2023-12-15 20:44:56,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:44:56,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162089872] [2023-12-15 20:44:56,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:44:56,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:44:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:44:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:44:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:44:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:44:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:44:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:44:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:44:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:44:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:44:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:44:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:44:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:44:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:44:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:44:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:44:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:44:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:44:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:44:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,502 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-15 20:44:57,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:44:57,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162089872] [2023-12-15 20:44:57,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162089872] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:44:57,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:44:57,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 20:44:57,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210558418] [2023-12-15 20:44:57,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:44:57,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 20:44:57,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:44:57,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 20:44:57,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 20:44:57,512 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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-15 20:44:57,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:44:57,702 INFO L93 Difference]: Finished difference Result 146 states and 224 transitions. [2023-12-15 20:44:57,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 20:44:57,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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-15 20:44:57,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:44:57,706 INFO L225 Difference]: With dead ends: 146 [2023-12-15 20:44:57,706 INFO L226 Difference]: Without dead ends: 98 [2023-12-15 20:44:57,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-15 20:44:57,710 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 50 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:44:57,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 196 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:44:57,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-15 20:44:57,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2023-12-15 20:44:57,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-15 20:44:57,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 140 transitions. [2023-12-15 20:44:57,742 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 140 transitions. Word has length 112 [2023-12-15 20:44:57,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:44:57,744 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 140 transitions. [2023-12-15 20:44:57,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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-15 20:44:57,744 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2023-12-15 20:44:57,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 20:44:57,749 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:44:57,749 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, 1] [2023-12-15 20:44:57,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 20:44:57,749 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:44:57,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:44:57,750 INFO L85 PathProgramCache]: Analyzing trace with hash -810944936, now seen corresponding path program 1 times [2023-12-15 20:44:57,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:44:57,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371789394] [2023-12-15 20:44:57,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:44:57,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:44:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:44:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:44:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:44:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:44:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:44:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:44:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:44:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:44:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:44:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:44:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:44:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:44:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:44:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:44:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:44:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:44:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:44:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:44:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:57,880 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-15 20:44:57,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:44:57,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371789394] [2023-12-15 20:44:57,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371789394] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:44:57,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:44:57,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:44:57,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849312600] [2023-12-15 20:44:57,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:44:57,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:44:57,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:44:57,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:44:57,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:44:57,882 INFO L87 Difference]: Start difference. First operand 91 states and 140 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-15 20:44:57,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:44:57,923 INFO L93 Difference]: Finished difference Result 162 states and 249 transitions. [2023-12-15 20:44:57,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:44:57,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 114 [2023-12-15 20:44:57,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:44:57,927 INFO L225 Difference]: With dead ends: 162 [2023-12-15 20:44:57,927 INFO L226 Difference]: Without dead ends: 114 [2023-12-15 20:44:57,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:44:57,931 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 13 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:44:57,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 134 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:44:57,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-15 20:44:57,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2023-12-15 20:44:57,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 69 states have (on average 1.391304347826087) internal successors, (96), 69 states have internal predecessors, (96), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-15 20:44:57,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 168 transitions. [2023-12-15 20:44:57,956 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 168 transitions. Word has length 114 [2023-12-15 20:44:57,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:44:57,957 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 168 transitions. [2023-12-15 20:44:57,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-15 20:44:57,958 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 168 transitions. [2023-12-15 20:44:57,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 20:44:57,960 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:44:57,960 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, 1] [2023-12-15 20:44:57,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 20:44:57,960 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:44:57,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:44:57,961 INFO L85 PathProgramCache]: Analyzing trace with hash -811004518, now seen corresponding path program 1 times [2023-12-15 20:44:57,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:44:57,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229513087] [2023-12-15 20:44:57,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:44:57,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:44:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:44:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:44:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:44:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:44:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:44:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:44:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:44:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:44:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:44:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:44:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:44:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:44:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:44:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:44:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:44:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:44:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:44:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:44:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,119 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-15 20:44:58,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:44:58,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229513087] [2023-12-15 20:44:58,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229513087] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:44:58,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:44:58,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 20:44:58,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452187495] [2023-12-15 20:44:58,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:44:58,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 20:44:58,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:44:58,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 20:44:58,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 20:44:58,121 INFO L87 Difference]: Start difference. First operand 108 states and 168 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-15 20:44:58,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:44:58,205 INFO L93 Difference]: Finished difference Result 172 states and 265 transitions. [2023-12-15 20:44:58,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 20:44:58,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 114 [2023-12-15 20:44:58,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:44:58,207 INFO L225 Difference]: With dead ends: 172 [2023-12-15 20:44:58,207 INFO L226 Difference]: Without dead ends: 107 [2023-12-15 20:44:58,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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-15 20:44:58,208 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 47 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:44:58,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 200 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:44:58,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-15 20:44:58,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2023-12-15 20:44:58,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-15 20:44:58,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 155 transitions. [2023-12-15 20:44:58,221 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 155 transitions. Word has length 114 [2023-12-15 20:44:58,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:44:58,221 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 155 transitions. [2023-12-15 20:44:58,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-15 20:44:58,221 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 155 transitions. [2023-12-15 20:44:58,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 20:44:58,222 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:44:58,222 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, 1] [2023-12-15 20:44:58,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 20:44:58,222 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:44:58,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:44:58,222 INFO L85 PathProgramCache]: Analyzing trace with hash -552779498, now seen corresponding path program 1 times [2023-12-15 20:44:58,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:44:58,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762315308] [2023-12-15 20:44:58,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:44:58,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:44:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:44:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:44:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:44:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:44:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:44:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:44:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:44:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:44:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:44:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:44:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:44:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:44:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:44:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:44:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:44:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:44:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:44:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:44:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:44:58,553 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-15 20:44:58,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:44:58,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762315308] [2023-12-15 20:44:58,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762315308] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:44:58,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:44:58,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 20:44:58,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483787607] [2023-12-15 20:44:58,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:44:58,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 20:44:58,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:44:58,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 20:44:58,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 20:44:58,555 INFO L87 Difference]: Start difference. First operand 101 states and 155 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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-15 20:44:58,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:44:58,757 INFO L93 Difference]: Finished difference Result 201 states and 299 transitions. [2023-12-15 20:44:58,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 20:44:58,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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 114 [2023-12-15 20:44:58,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:44:58,759 INFO L225 Difference]: With dead ends: 201 [2023-12-15 20:44:58,760 INFO L226 Difference]: Without dead ends: 138 [2023-12-15 20:44:58,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-15 20:44:58,761 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 92 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:44:58,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 296 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:44:58,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-12-15 20:44:58,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 102. [2023-12-15 20:44:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-15 20:44:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 156 transitions. [2023-12-15 20:44:58,788 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 156 transitions. Word has length 114 [2023-12-15 20:44:58,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:44:58,788 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 156 transitions. [2023-12-15 20:44:58,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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-15 20:44:58,789 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 156 transitions. [2023-12-15 20:44:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 20:44:58,789 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:44:58,789 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, 1] [2023-12-15 20:44:58,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 20:44:58,790 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:44:58,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:44:58,790 INFO L85 PathProgramCache]: Analyzing trace with hash -945806508, now seen corresponding path program 1 times [2023-12-15 20:44:58,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:44:58,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001699364] [2023-12-15 20:44:58,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:44:58,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:44:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:01,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:45:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:01,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:45:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:01,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:45:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:01,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:45:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:01,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:45:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:01,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:45:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:01,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:45:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:01,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:45:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:01,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:45:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:01,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:45:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:01,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:45:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:01,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:45:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:01,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:45:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:01,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:45:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:01,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:45:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:01,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:45:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:01,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:45:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:01,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:45:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:01,393 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-15 20:45:01,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:45:01,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001699364] [2023-12-15 20:45:01,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001699364] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:45:01,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:45:01,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 20:45:01,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096495371] [2023-12-15 20:45:01,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:45:01,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 20:45:01,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:45:01,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 20:45:01,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:45:01,395 INFO L87 Difference]: Start difference. First operand 102 states and 156 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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-15 20:45:02,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:45:02,050 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2023-12-15 20:45:02,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 20:45:02,051 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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 114 [2023-12-15 20:45:02,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:45:02,052 INFO L225 Difference]: With dead ends: 121 [2023-12-15 20:45:02,052 INFO L226 Difference]: Without dead ends: 119 [2023-12-15 20:45:02,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-12-15 20:45:02,052 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 58 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:45:02,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 268 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:45:02,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-15 20:45:02,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2023-12-15 20:45:02,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-15 20:45:02,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 173 transitions. [2023-12-15 20:45:02,069 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 173 transitions. Word has length 114 [2023-12-15 20:45:02,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:45:02,069 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 173 transitions. [2023-12-15 20:45:02,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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-15 20:45:02,070 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 173 transitions. [2023-12-15 20:45:02,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 20:45:02,070 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:45:02,070 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, 1] [2023-12-15 20:45:02,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 20:45:02,071 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:45:02,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:45:02,071 INFO L85 PathProgramCache]: Analyzing trace with hash 829200854, now seen corresponding path program 1 times [2023-12-15 20:45:02,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:45:02,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851099512] [2023-12-15 20:45:02,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:45:02,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:45:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:04,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:45:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:04,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:45:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:04,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:45:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:04,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:45:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:04,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:45:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:04,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:45:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:04,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:45:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:04,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:45:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:04,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:45:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:04,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:45:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:04,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:45:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:04,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:45:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:04,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:45:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:04,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:45:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:04,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:45:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:04,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:45:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:04,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:45:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:04,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:45:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:04,955 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-15 20:45:04,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:45:04,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851099512] [2023-12-15 20:45:04,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851099512] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:45:04,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:45:04,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 20:45:04,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687409629] [2023-12-15 20:45:04,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:45:04,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 20:45:04,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:45:04,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 20:45:04,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:45:04,957 INFO L87 Difference]: Start difference. First operand 117 states and 173 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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-15 20:45:05,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:45:05,465 INFO L93 Difference]: Finished difference Result 117 states and 173 transitions. [2023-12-15 20:45:05,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 20:45:05,465 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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 114 [2023-12-15 20:45:05,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:45:05,466 INFO L225 Difference]: With dead ends: 117 [2023-12-15 20:45:05,466 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 20:45:05,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-12-15 20:45:05,467 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 28 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:45:05,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 256 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:45:05,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 20:45:05,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 20:45:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 20:45:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 20:45:05,468 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 114 [2023-12-15 20:45:05,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:45:05,468 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 20:45:05,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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-15 20:45:05,468 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 20:45:05,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 20:45:05,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 20:45:05,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 20:45:05,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 20:45:05,993 INFO L899 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2023-12-15 20:45:05,994 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-15 20:45:05,994 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-15 20:45:05,994 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-15 20:45:05,994 INFO L902 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: true [2023-12-15 20:45:05,994 INFO L902 garLoopResultBuilder]: At program point L77-1(line 77) the Hoare annotation is: true [2023-12-15 20:45:05,994 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2023-12-15 20:45:05,995 INFO L895 garLoopResultBuilder]: At program point L110-2(lines 110 116) the Hoare annotation is: (let ((.cse0 (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)))) (or (and .cse0 (= (+ 16 ~var_1_15~0) 0) (<= (+ (div ~last_1_var_1_15~0 4294967296) 1) 0) (= 25 ~var_1_10~0) (<= ~last_1_var_1_10~0 (+ 41 ~last_1_var_1_15~0)) (<= 0 (div ~last_1_var_1_18~0 256)) (<= 25 ~last_1_var_1_10~0) (= ~var_1_18~0 0) (< ~last_1_var_1_18~0 1)) (let ((.cse8 (* (div ~var_1_12~0 4294967296) 4294967296)) (.cse13 (+ ~var_1_8~0 1)) (.cse14 (= ~var_1_9~0 ~var_1_7~0)) (.cse4 (* (div ~var_1_10~0 4294967296) 4294967296)) (.cse11 (* 4294967295 ~var_1_13~0))) (let ((.cse1 (* 256 (div ~var_1_19~0 256))) (.cse7 (+ (* (div ~var_1_13~0 4294967296) 4294967296) ~var_1_12~0)) (.cse6 (or (and (<= .cse13 ~var_1_9~0) .cse14) (= (+ (* (div (+ .cse11 ~var_1_11~0) 4294967296) 4294967296) ~var_1_10~0) (+ .cse4 .cse11 ~var_1_11~0)))) (.cse2 (not .cse14)) (.cse3 (< ~var_1_1~0 .cse13)) (.cse12 (< (+ .cse8 ~var_1_8~0) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_12~0)))) (and (= ~var_1_1~0 ~var_1_7~0) (= (+ (* (div ~var_1_18~0 256) 256) ~var_1_19~0) (+ ~var_1_18~0 .cse1)) (or (and (or .cse2 .cse3 (let ((.cse5 (* 4294967295 ~var_1_12~0))) (= (+ .cse4 ~var_1_11~0 .cse5 1) (+ ~var_1_10~0 (* 4294967296 (div (+ ~var_1_11~0 .cse5 1) 4294967296)))))) .cse6) (< .cse7 (+ .cse8 ~var_1_13~0 1))) (<= .cse1 ~var_1_18~0) (or .cse0 (and (or (< ~var_1_9~0 ~var_1_7~0) (let ((.cse9 (* (div ~var_1_9~0 256) 256))) (and (or (= (+ .cse9 256 ~var_1_8~0) ~var_1_9~0) (< ~var_1_9~0 (+ .cse9 128))) (or (< (+ .cse9 127) ~var_1_9~0) (= (+ .cse9 ~var_1_8~0) ~var_1_9~0))))) (or (let ((.cse10 (* (div ~var_1_7~0 256) 256))) (and (or (< (+ 127 .cse10) ~var_1_7~0) (= (+ ~var_1_8~0 .cse10) ~var_1_7~0)) (or (= (+ 256 ~var_1_8~0 .cse10) ~var_1_7~0) (< ~var_1_7~0 (+ 128 .cse10))))) (< ~var_1_7~0 (+ ~var_1_9~0 1))))) (or (< (+ .cse8 ~var_1_13~0) .cse7) (and .cse6 (or .cse2 .cse3 (= (+ .cse4 .cse11 ~var_1_11~0 1) (+ (* 4294967296 (div (+ .cse11 ~var_1_11~0 1) 4294967296)) ~var_1_10~0))))) (or (< ~var_1_8~0 0) (= ~var_1_8~0 ~var_1_14~0) .cse12) (or (= (+ ~var_1_8~0 ~var_1_14~0) 0) (< 0 .cse13) .cse12) (= 2 ~var_1_15~0) (= ~var_1_17~0 ~var_1_16~0)))))) [2023-12-15 20:45:05,995 INFO L899 garLoopResultBuilder]: For program point L110-3(lines 110 116) no Hoare annotation was computed. [2023-12-15 20:45:05,995 INFO L899 garLoopResultBuilder]: For program point L44-2(line 44) no Hoare annotation was computed. [2023-12-15 20:45:05,995 INFO L899 garLoopResultBuilder]: For program point L44-4(lines 44 52) no Hoare annotation was computed. [2023-12-15 20:45:05,995 INFO L899 garLoopResultBuilder]: For program point L44-5(lines 43 68) no Hoare annotation was computed. [2023-12-15 20:45:05,995 INFO L902 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: true [2023-12-15 20:45:05,995 INFO L902 garLoopResultBuilder]: At program point L86-1(line 86) the Hoare annotation is: true [2023-12-15 20:45:05,995 INFO L899 garLoopResultBuilder]: For program point L53-1(lines 43 68) no Hoare annotation was computed. [2023-12-15 20:45:05,995 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-12-15 20:45:05,995 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 49) no Hoare annotation was computed. [2023-12-15 20:45:05,996 INFO L902 garLoopResultBuilder]: At program point L95(line 95) the Hoare annotation is: true [2023-12-15 20:45:05,996 INFO L902 garLoopResultBuilder]: At program point L95-1(line 95) the Hoare annotation is: true [2023-12-15 20:45:05,996 INFO L899 garLoopResultBuilder]: For program point L87(line 87) no Hoare annotation was computed. [2023-12-15 20:45:05,996 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 20:45:05,996 INFO L899 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2023-12-15 20:45:05,996 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (or (= ~var_1_1~0 ~var_1_7~0) (and (= (+ 16 ~var_1_15~0) 0) (<= (+ (div ~last_1_var_1_15~0 4294967296) 1) 0) (= 25 ~var_1_10~0) (<= ~last_1_var_1_10~0 (+ 41 ~last_1_var_1_15~0)) (<= 0 (div ~last_1_var_1_18~0 256)) (<= 25 ~last_1_var_1_10~0) (= ~var_1_18~0 0) (< ~last_1_var_1_18~0 1))) [2023-12-15 20:45:05,996 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (or (= ~var_1_1~0 ~var_1_7~0) (and (= (+ 16 ~var_1_15~0) 0) (<= (+ (div ~last_1_var_1_15~0 4294967296) 1) 0) (= 25 ~var_1_10~0) (<= ~last_1_var_1_10~0 (+ 41 ~last_1_var_1_15~0)) (<= 0 (div ~last_1_var_1_18~0 256)) (<= 25 ~last_1_var_1_10~0) (= ~var_1_18~0 0) (< ~last_1_var_1_18~0 1))) [2023-12-15 20:45:05,996 INFO L899 garLoopResultBuilder]: For program point L104-2(line 104) no Hoare annotation was computed. [2023-12-15 20:45:05,996 INFO L899 garLoopResultBuilder]: For program point L104-4(line 104) no Hoare annotation was computed. [2023-12-15 20:45:05,996 INFO L899 garLoopResultBuilder]: For program point L96(lines 69 97) no Hoare annotation was computed. [2023-12-15 20:45:05,996 INFO L899 garLoopResultBuilder]: For program point L63(lines 63 67) no Hoare annotation was computed. [2023-12-15 20:45:05,996 INFO L902 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: true [2023-12-15 20:45:05,996 INFO L902 garLoopResultBuilder]: At program point L80-1(line 80) the Hoare annotation is: true [2023-12-15 20:45:05,997 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2023-12-15 20:45:05,997 INFO L902 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: true [2023-12-15 20:45:05,997 INFO L902 garLoopResultBuilder]: At program point L89-1(line 89) the Hoare annotation is: true [2023-12-15 20:45:05,997 INFO L899 garLoopResultBuilder]: For program point L56-1(lines 56 58) no Hoare annotation was computed. [2023-12-15 20:45:05,997 INFO L899 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2023-12-15 20:45:05,997 INFO L899 garLoopResultBuilder]: For program point L90(line 90) no Hoare annotation was computed. [2023-12-15 20:45:05,997 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-15 20:45:05,997 INFO L895 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: (or (= ~var_1_1~0 ~var_1_7~0) (and (= (+ 16 ~var_1_15~0) 0) (<= (+ (div ~last_1_var_1_15~0 4294967296) 1) 0) (= 25 ~var_1_10~0) (<= ~last_1_var_1_10~0 (+ 41 ~last_1_var_1_15~0)) (<= 0 (div ~last_1_var_1_18~0 256)) (<= 25 ~last_1_var_1_10~0) (= ~var_1_18~0 0) (< ~last_1_var_1_18~0 1))) [2023-12-15 20:45:05,997 INFO L895 garLoopResultBuilder]: At program point L74-1(line 74) the Hoare annotation is: (or (= ~var_1_1~0 ~var_1_7~0) (and (= (+ 16 ~var_1_15~0) 0) (<= (+ (div ~last_1_var_1_15~0 4294967296) 1) 0) (= 25 ~var_1_10~0) (<= ~last_1_var_1_10~0 (+ 41 ~last_1_var_1_15~0)) (<= 0 (div ~last_1_var_1_18~0 256)) (<= 25 ~last_1_var_1_10~0) (= ~var_1_18~0 0) (< ~last_1_var_1_18~0 1))) [2023-12-15 20:45:05,997 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 20:45:05,997 INFO L902 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: true [2023-12-15 20:45:05,997 INFO L902 garLoopResultBuilder]: At program point L83-1(line 83) the Hoare annotation is: true [2023-12-15 20:45:05,997 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-12-15 20:45:05,997 INFO L902 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: true [2023-12-15 20:45:05,998 INFO L902 garLoopResultBuilder]: At program point L92-1(line 92) the Hoare annotation is: true [2023-12-15 20:45:05,998 INFO L899 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2023-12-15 20:45:05,998 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 68) no Hoare annotation was computed. [2023-12-15 20:45:05,998 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-15 20:45:05,998 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-15 20:45:05,998 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-15 20:45:05,998 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-15 20:45:06,000 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:45:06,001 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 20:45:06,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:45:06 BoogieIcfgContainer [2023-12-15 20:45:06,025 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 20:45:06,026 INFO L158 Benchmark]: Toolchain (without parser) took 10393.92ms. Allocated memory was 173.0MB in the beginning and 461.4MB in the end (delta: 288.4MB). Free memory was 130.2MB in the beginning and 290.6MB in the end (delta: -160.4MB). Peak memory consumption was 128.3MB. Max. memory is 8.0GB. [2023-12-15 20:45:06,026 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 173.0MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:45:06,026 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.95ms. Allocated memory is still 173.0MB. Free memory was 129.9MB in the beginning and 117.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 20:45:06,026 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.64ms. Allocated memory is still 173.0MB. Free memory was 117.0MB in the beginning and 114.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 20:45:06,026 INFO L158 Benchmark]: Boogie Preprocessor took 27.09ms. Allocated memory is still 173.0MB. Free memory was 114.9MB in the beginning and 112.4MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 20:45:06,027 INFO L158 Benchmark]: RCFGBuilder took 395.59ms. Allocated memory is still 173.0MB. Free memory was 112.4MB in the beginning and 93.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-15 20:45:06,027 INFO L158 Benchmark]: TraceAbstraction took 9713.39ms. Allocated memory was 173.0MB in the beginning and 461.4MB in the end (delta: 288.4MB). Free memory was 92.9MB in the beginning and 290.6MB in the end (delta: -197.7MB). Peak memory consumption was 91.6MB. Max. memory is 8.0GB. [2023-12-15 20:45:06,029 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 173.0MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 221.95ms. Allocated memory is still 173.0MB. Free memory was 129.9MB in the beginning and 117.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.64ms. Allocated memory is still 173.0MB. Free memory was 117.0MB in the beginning and 114.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.09ms. Allocated memory is still 173.0MB. Free memory was 114.9MB in the beginning and 112.4MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 395.59ms. Allocated memory is still 173.0MB. Free memory was 112.4MB in the beginning and 93.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 9713.39ms. Allocated memory was 173.0MB in the beginning and 461.4MB in the end (delta: 288.4MB). Free memory was 92.9MB in the beginning and 290.6MB in the end (delta: -197.7MB). Peak memory consumption was 91.6MB. 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, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 7, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 288 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 1422 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 925 mSDsCounter, 181 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 342 IncrementalHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 181 mSolverCounterUnsat, 497 mSDtfsCounter, 342 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 326 GetRequests, 292 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=6, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 57 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 145 PreInvPairs, 183 NumberOfFragments, 560 HoareAnnotationTreeSize, 145 FormulaSimplifications, 479 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FormulaSimplificationsInter, 275 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 794 NumberOfCodeBlocks, 794 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 787 ConstructedInterpolants, 0 QuantifiedInterpolants, 5960 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 4284/4284 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: 110]: Loop Invariant Derived loop invariant: ((((((((((var_1_5 == ((var_1_5 / 256) * 256)) && ((16 + var_1_15) == 0)) && (((last_1_var_1_15 / 4294967296) + 1) <= 0)) && (25 == var_1_10)) && (last_1_var_1_10 <= (41 + last_1_var_1_15))) && (0 <= (last_1_var_1_18 / 256))) && (25 <= last_1_var_1_10)) && (var_1_18 == 0)) && (last_1_var_1_18 < 1)) || ((((((((((var_1_1 == var_1_7) && ((((var_1_18 / 256) * 256) + var_1_19) == (var_1_18 + (256 * (var_1_19 / 256))))) && ((((!((var_1_9 == var_1_7)) || (var_1_1 < (var_1_8 + 1))) || ((((((var_1_10 / 4294967296) * 4294967296) + var_1_11) + (4294967295 * var_1_12)) + 1) == (var_1_10 + (4294967296 * (((var_1_11 + (4294967295 * var_1_12)) + 1) / 4294967296))))) && ((((var_1_8 + 1) <= var_1_9) && (var_1_9 == var_1_7)) || ((((((4294967295 * var_1_13) + var_1_11) / 4294967296) * 4294967296) + var_1_10) == ((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + var_1_11)))) || ((((var_1_13 / 4294967296) * 4294967296) + var_1_12) < ((((var_1_12 / 4294967296) * 4294967296) + var_1_13) + 1)))) && ((256 * (var_1_19 / 256)) <= var_1_18)) && ((var_1_5 == ((var_1_5 / 256) * 256)) || (((var_1_9 < var_1_7) || (((((((var_1_9 / 256) * 256) + 256) + var_1_8) == var_1_9) || (var_1_9 < (((var_1_9 / 256) * 256) + 128))) && (((((var_1_9 / 256) * 256) + 127) < var_1_9) || ((((var_1_9 / 256) * 256) + var_1_8) == var_1_9)))) && (((((127 + ((var_1_7 / 256) * 256)) < var_1_7) || ((var_1_8 + ((var_1_7 / 256) * 256)) == var_1_7)) && ((((256 + var_1_8) + ((var_1_7 / 256) * 256)) == var_1_7) || (var_1_7 < (128 + ((var_1_7 / 256) * 256))))) || (var_1_7 < (var_1_9 + 1)))))) && (((((var_1_12 / 4294967296) * 4294967296) + var_1_13) < (((var_1_13 / 4294967296) * 4294967296) + var_1_12)) || (((((var_1_8 + 1) <= var_1_9) && (var_1_9 == var_1_7)) || ((((((4294967295 * var_1_13) + var_1_11) / 4294967296) * 4294967296) + var_1_10) == ((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + var_1_11))) && ((!((var_1_9 == var_1_7)) || (var_1_1 < (var_1_8 + 1))) || ((((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + var_1_11) + 1) == ((4294967296 * ((((4294967295 * var_1_13) + var_1_11) + 1) / 4294967296)) + var_1_10)))))) && (((var_1_8 < 0) || (var_1_8 == var_1_14)) || ((((var_1_12 / 4294967296) * 4294967296) + var_1_8) < (((var_1_8 / 4294967296) * 4294967296) + var_1_12)))) && ((((var_1_8 + var_1_14) == 0) || (0 < (var_1_8 + 1))) || ((((var_1_12 / 4294967296) * 4294967296) + var_1_8) < (((var_1_8 / 4294967296) * 4294967296) + var_1_12)))) && (2 == var_1_15)) && (var_1_17 == var_1_16))) RESULT: Ultimate proved your program to be correct! [2023-12-15 20:45:06,055 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...