./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-59.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 613ea7964a044fd06639761bd4fafbf6e497c5859bca7c7122d30954c90058a2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:54:14,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:54:14,788 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 05:54:14,797 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:54:14,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:54:14,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:54:14,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:54:14,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:54:14,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:54:14,867 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:54:14,868 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:54:14,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:54:14,869 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:54:14,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:54:14,871 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:54:14,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:54:14,871 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:54:14,872 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:54:14,872 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 05:54:14,872 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:54:14,872 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:54:14,876 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:54:14,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:54:14,876 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:54:14,877 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:54:14,877 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:54:14,877 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:54:14,877 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:54:14,878 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:54:14,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:54:14,878 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:54:14,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:54:14,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:54:14,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:54:14,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:54:14,879 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:54:14,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 05:54:14,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 05:54:14,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:54:14,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:54:14,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:54:14,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:54:14,882 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 613ea7964a044fd06639761bd4fafbf6e497c5859bca7c7122d30954c90058a2 [2024-11-20 05:54:15,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:54:15,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:54:15,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:54:15,162 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:54:15,165 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:54:15,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-59.i [2024-11-20 05:54:16,662 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:54:16,863 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:54:16,864 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-59.i [2024-11-20 05:54:16,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/119cc78d8/9a01c381f7b94992a74ce021ff7e42e7/FLAG06ed3f2a0 [2024-11-20 05:54:16,885 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/119cc78d8/9a01c381f7b94992a74ce021ff7e42e7 [2024-11-20 05:54:16,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:54:16,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:54:16,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:54:16,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:54:16,897 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:54:16,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:54:16" (1/1) ... [2024-11-20 05:54:16,899 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c7e2143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:16, skipping insertion in model container [2024-11-20 05:54:16,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:54:16" (1/1) ... [2024-11-20 05:54:16,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:54:17,108 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-59.i[917,930] [2024-11-20 05:54:17,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:54:17,154 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:54:17,163 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-59.i[917,930] [2024-11-20 05:54:17,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:54:17,207 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:54:17,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:17 WrapperNode [2024-11-20 05:54:17,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:54:17,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:54:17,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:54:17,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:54:17,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:17" (1/1) ... [2024-11-20 05:54:17,223 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:17" (1/1) ... [2024-11-20 05:54:17,247 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-11-20 05:54:17,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:54:17,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:54:17,249 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:54:17,249 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:54:17,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:17" (1/1) ... [2024-11-20 05:54:17,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:17" (1/1) ... [2024-11-20 05:54:17,261 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:17" (1/1) ... [2024-11-20 05:54:17,275 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]. [2024-11-20 05:54:17,275 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:17" (1/1) ... [2024-11-20 05:54:17,275 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:17" (1/1) ... [2024-11-20 05:54:17,283 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:17" (1/1) ... [2024-11-20 05:54:17,286 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:17" (1/1) ... [2024-11-20 05:54:17,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:17" (1/1) ... [2024-11-20 05:54:17,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:17" (1/1) ... [2024-11-20 05:54:17,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:54:17,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:54:17,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:54:17,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:54:17,294 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:17" (1/1) ... [2024-11-20 05:54:17,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:54:17,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:54:17,365 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) [2024-11-20 05:54:17,369 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 [2024-11-20 05:54:17,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:54:17,438 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:54:17,438 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:54:17,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 05:54:17,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:54:17,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:54:17,518 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:54:17,523 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:54:17,820 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 05:54:17,820 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:54:17,833 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:54:17,833 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:54:17,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:54:17 BoogieIcfgContainer [2024-11-20 05:54:17,834 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:54:17,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:54:17,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:54:17,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:54:17,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:54:16" (1/3) ... [2024-11-20 05:54:17,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5be77c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:54:17, skipping insertion in model container [2024-11-20 05:54:17,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:17" (2/3) ... [2024-11-20 05:54:17,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5be77c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:54:17, skipping insertion in model container [2024-11-20 05:54:17,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:54:17" (3/3) ... [2024-11-20 05:54:17,848 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-59.i [2024-11-20 05:54:17,868 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:54:17,869 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:54:17,933 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:54:17,940 INFO L333 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, 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;@7d3a60b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:54:17,940 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:54:17,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 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) [2024-11-20 05:54:17,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 05:54:17,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:54:17,962 INFO L215 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] [2024-11-20 05:54:17,962 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:54:17,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:54:17,968 INFO L85 PathProgramCache]: Analyzing trace with hash 436534238, now seen corresponding path program 1 times [2024-11-20 05:54:17,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:54:17,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474606004] [2024-11-20 05:54:17,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:54:17,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:54:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:18,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:54:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:18,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:54:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:18,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:54:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:18,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:54:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:18,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:54:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:18,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:54:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:18,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:54:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:18,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:54:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:18,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:54:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:18,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:54:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:18,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:54:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:18,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:54:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:18,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:54:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:18,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:54:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:18,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:54:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:18,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:54:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:18,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:54:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:18,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:54:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:18,352 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 05:54:18,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:54:18,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474606004] [2024-11-20 05:54:18,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474606004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:54:18,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:54:18,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:54:18,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796024124] [2024-11-20 05:54:18,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:54:18,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:54:18,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:54:18,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:54:18,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:54:18,392 INFO L87 Difference]: Start difference. First operand has 52 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 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.0) internal successors, (24), 2 states have internal predecessors, (24), 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) [2024-11-20 05:54:18,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:54:18,428 INFO L93 Difference]: Finished difference Result 97 states and 168 transitions. [2024-11-20 05:54:18,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:54:18,434 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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 111 [2024-11-20 05:54:18,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:54:18,446 INFO L225 Difference]: With dead ends: 97 [2024-11-20 05:54:18,446 INFO L226 Difference]: Without dead ends: 48 [2024-11-20 05:54:18,472 INFO L431 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 [2024-11-20 05:54:18,484 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:54:18,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:54:18,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-20 05:54:18,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-20 05:54:18,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 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) [2024-11-20 05:54:18,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2024-11-20 05:54:18,527 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 111 [2024-11-20 05:54:18,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:54:18,528 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2024-11-20 05:54:18,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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) [2024-11-20 05:54:18,528 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2024-11-20 05:54:18,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 05:54:18,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:54:18,531 INFO L215 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] [2024-11-20 05:54:18,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 05:54:18,532 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:54:18,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:54:18,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1117207838, now seen corresponding path program 1 times [2024-11-20 05:54:18,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:54:18,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992971409] [2024-11-20 05:54:18,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:54:18,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:54:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:18,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:54:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:18,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:54:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:18,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:54:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:18,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:54:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:18,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:54:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:18,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:54:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:19,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:54:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:19,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:54:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:19,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:54:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:19,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:54:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:19,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:54:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:19,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:54:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:19,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:54:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:19,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:54:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:19,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:54:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:19,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:54:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:19,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:54:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:19,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:54:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 05:54:19,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:54:19,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992971409] [2024-11-20 05:54:19,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992971409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:54:19,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:54:19,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:54:19,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761375381] [2024-11-20 05:54:19,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:54:19,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:54:19,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:54:19,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:54:19,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:54:19,112 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 05:54:19,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:54:19,315 INFO L93 Difference]: Finished difference Result 139 states and 208 transitions. [2024-11-20 05:54:19,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 05:54:19,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2024-11-20 05:54:19,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:54:19,319 INFO L225 Difference]: With dead ends: 139 [2024-11-20 05:54:19,319 INFO L226 Difference]: Without dead ends: 94 [2024-11-20 05:54:19,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:54:19,321 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 40 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:54:19,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 178 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:54:19,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-20 05:54:19,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2024-11-20 05:54:19,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 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) [2024-11-20 05:54:19,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 125 transitions. [2024-11-20 05:54:19,365 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 125 transitions. Word has length 111 [2024-11-20 05:54:19,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:54:19,366 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 125 transitions. [2024-11-20 05:54:19,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 05:54:19,366 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 125 transitions. [2024-11-20 05:54:19,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-20 05:54:19,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:54:19,371 INFO L215 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] [2024-11-20 05:54:19,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 05:54:19,371 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:54:19,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:54:19,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1580942571, now seen corresponding path program 1 times [2024-11-20 05:54:19,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:54:19,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677931272] [2024-11-20 05:54:19,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:54:19,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:54:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:23,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:54:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:23,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:54:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:23,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:54:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:23,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:54:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:23,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:54:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:23,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:54:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:23,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:54:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:23,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:54:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:23,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:54:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:23,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:54:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:23,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:54:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:23,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:54:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:23,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:54:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:23,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:54:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:23,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:54:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:23,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:54:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:23,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:54:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:23,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:54:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:23,163 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 05:54:23,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:54:23,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677931272] [2024-11-20 05:54:23,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677931272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:54:23,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:54:23,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 05:54:23,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096881052] [2024-11-20 05:54:23,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:54:23,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 05:54:23,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:54:23,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 05:54:23,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 05:54:23,166 INFO L87 Difference]: Start difference. First operand 84 states and 125 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 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) [2024-11-20 05:54:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:54:23,493 INFO L93 Difference]: Finished difference Result 112 states and 160 transitions. [2024-11-20 05:54:23,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 05:54:23,493 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 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 [2024-11-20 05:54:23,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:54:23,496 INFO L225 Difference]: With dead ends: 112 [2024-11-20 05:54:23,496 INFO L226 Difference]: Without dead ends: 110 [2024-11-20 05:54:23,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-20 05:54:23,500 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 37 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:54:23,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 329 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:54:23,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-20 05:54:23,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 89. [2024-11-20 05:54:23,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 50 states have (on average 1.2) internal successors, (60), 50 states have internal predecessors, (60), 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) [2024-11-20 05:54:23,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 132 transitions. [2024-11-20 05:54:23,522 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 132 transitions. Word has length 112 [2024-11-20 05:54:23,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:54:23,523 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 132 transitions. [2024-11-20 05:54:23,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 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) [2024-11-20 05:54:23,523 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 132 transitions. [2024-11-20 05:54:23,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 05:54:23,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:54:23,525 INFO L215 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] [2024-11-20 05:54:23,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 05:54:23,526 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:54:23,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:54:23,526 INFO L85 PathProgramCache]: Analyzing trace with hash 161072197, now seen corresponding path program 1 times [2024-11-20 05:54:23,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:54:23,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329886660] [2024-11-20 05:54:23,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:54:23,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:54:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:26,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:54:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:26,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:54:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:26,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:54:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:26,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:54:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:26,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:54:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:26,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:54:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:26,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:54:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:26,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:54:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:26,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:54:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:26,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:54:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:26,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:54:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:26,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:54:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:26,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:54:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:26,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:54:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:26,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:54:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:26,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:54:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:26,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:54:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:26,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:54:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:26,248 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 05:54:26,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:54:26,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329886660] [2024-11-20 05:54:26,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329886660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:54:26,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:54:26,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 05:54:26,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140048802] [2024-11-20 05:54:26,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:54:26,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 05:54:26,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:54:26,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 05:54:26,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-20 05:54:26,251 INFO L87 Difference]: Start difference. First operand 89 states and 132 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 05:54:26,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:54:26,656 INFO L93 Difference]: Finished difference Result 126 states and 178 transitions. [2024-11-20 05:54:26,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 05:54:26,657 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2024-11-20 05:54:26,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:54:26,659 INFO L225 Difference]: With dead ends: 126 [2024-11-20 05:54:26,659 INFO L226 Difference]: Without dead ends: 124 [2024-11-20 05:54:26,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-20 05:54:26,661 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 54 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:54:26,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 346 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:54:26,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-20 05:54:26,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 89. [2024-11-20 05:54:26,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 50 states have (on average 1.2) internal successors, (60), 50 states have internal predecessors, (60), 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) [2024-11-20 05:54:26,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 132 transitions. [2024-11-20 05:54:26,677 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 132 transitions. Word has length 113 [2024-11-20 05:54:26,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:54:26,678 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 132 transitions. [2024-11-20 05:54:26,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 05:54:26,678 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 132 transitions. [2024-11-20 05:54:26,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 05:54:26,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:54:26,682 INFO L215 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] [2024-11-20 05:54:26,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 05:54:26,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:54:26,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:54:26,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1301901591, now seen corresponding path program 1 times [2024-11-20 05:54:26,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:54:26,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998118906] [2024-11-20 05:54:26,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:54:26,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:54:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:31,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:54:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:31,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:54:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:31,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:54:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:31,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:54:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:31,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:54:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:31,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:54:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:31,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:54:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:31,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:54:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:31,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:54:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:31,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:54:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:31,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:54:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:31,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:54:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:31,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:54:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:31,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:54:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:31,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:54:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:31,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:54:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:31,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:54:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:31,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:54:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:31,564 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 05:54:31,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:54:31,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998118906] [2024-11-20 05:54:31,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998118906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:54:31,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:54:31,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 05:54:31,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900962568] [2024-11-20 05:54:31,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:54:31,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 05:54:31,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:54:31,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 05:54:31,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-20 05:54:31,567 INFO L87 Difference]: Start difference. First operand 89 states and 132 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 05:54:32,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:54:32,252 INFO L93 Difference]: Finished difference Result 105 states and 153 transitions. [2024-11-20 05:54:32,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 05:54:32,252 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2024-11-20 05:54:32,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:54:32,254 INFO L225 Difference]: With dead ends: 105 [2024-11-20 05:54:32,254 INFO L226 Difference]: Without dead ends: 103 [2024-11-20 05:54:32,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2024-11-20 05:54:32,256 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 27 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:54:32,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 274 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:54:32,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-20 05:54:32,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 90. [2024-11-20 05:54:32,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 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) [2024-11-20 05:54:32,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 134 transitions. [2024-11-20 05:54:32,269 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 134 transitions. Word has length 113 [2024-11-20 05:54:32,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:54:32,270 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 134 transitions. [2024-11-20 05:54:32,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 05:54:32,270 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 134 transitions. [2024-11-20 05:54:32,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-20 05:54:32,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:54:32,274 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:54:32,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 05:54:32,274 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:54:32,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:54:32,278 INFO L85 PathProgramCache]: Analyzing trace with hash 2008703854, now seen corresponding path program 1 times [2024-11-20 05:54:32,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:54:32,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422692617] [2024-11-20 05:54:32,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:54:32,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:54:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:54:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:54:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:54:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:54:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:54:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:54:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:54:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:54:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:54:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:54:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:54:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:54:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:54:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:54:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:54:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:54:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:54:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:54:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-20 05:54:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 05:54:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 05:54:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-20 05:54:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 05:54:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 05:54:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 05:54:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 05:54:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 05:54:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-20 05:54:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-20 05:54:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-20 05:54:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-20 05:54:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-20 05:54:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-20 05:54:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-20 05:54:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-20 05:54:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-20 05:54:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:33,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2024-11-20 05:54:33,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:54:33,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422692617] [2024-11-20 05:54:33,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422692617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:54:33,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:54:33,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 05:54:33,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683390320] [2024-11-20 05:54:33,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:54:33,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 05:54:33,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:54:33,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 05:54:33,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-20 05:54:33,943 INFO L87 Difference]: Start difference. First operand 90 states and 134 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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) [2024-11-20 05:54:34,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:54:34,369 INFO L93 Difference]: Finished difference Result 116 states and 167 transitions. [2024-11-20 05:54:34,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 05:54:34,369 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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 222 [2024-11-20 05:54:34,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:54:34,371 INFO L225 Difference]: With dead ends: 116 [2024-11-20 05:54:34,371 INFO L226 Difference]: Without dead ends: 114 [2024-11-20 05:54:34,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-20 05:54:34,373 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 45 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:54:34,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 344 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:54:34,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-20 05:54:34,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 90. [2024-11-20 05:54:34,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 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) [2024-11-20 05:54:34,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 134 transitions. [2024-11-20 05:54:34,386 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 134 transitions. Word has length 222 [2024-11-20 05:54:34,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:54:34,386 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 134 transitions. [2024-11-20 05:54:34,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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) [2024-11-20 05:54:34,387 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 134 transitions. [2024-11-20 05:54:34,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-20 05:54:34,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:54:34,389 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:54:34,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 05:54:34,390 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:54:34,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:54:34,390 INFO L85 PathProgramCache]: Analyzing trace with hash -926203706, now seen corresponding path program 1 times [2024-11-20 05:54:34,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:54:34,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388323565] [2024-11-20 05:54:34,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:54:34,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:54:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:54:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:54:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:54:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:54:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:54:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:54:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:54:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:54:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:54:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:54:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:54:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:54:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:54:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:54:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:54:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:54:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:54:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:54:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-20 05:54:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 05:54:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 05:54:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-20 05:54:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 05:54:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 05:54:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 05:54:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 05:54:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 05:54:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-20 05:54:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-20 05:54:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-20 05:54:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-20 05:54:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-20 05:54:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-20 05:54:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-20 05:54:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-20 05:54:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-20 05:54:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:36,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2024-11-20 05:54:36,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:54:36,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388323565] [2024-11-20 05:54:36,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388323565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:54:36,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:54:36,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 05:54:36,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292507491] [2024-11-20 05:54:36,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:54:36,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 05:54:36,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:54:36,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 05:54:36,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-20 05:54:36,106 INFO L87 Difference]: Start difference. First operand 90 states and 134 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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) [2024-11-20 05:54:36,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:54:36,581 INFO L93 Difference]: Finished difference Result 114 states and 165 transitions. [2024-11-20 05:54:36,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 05:54:36,581 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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 223 [2024-11-20 05:54:36,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:54:36,582 INFO L225 Difference]: With dead ends: 114 [2024-11-20 05:54:36,582 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 05:54:36,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-11-20 05:54:36,584 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 49 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:54:36,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 299 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:54:36,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 05:54:36,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 05:54:36,589 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) [2024-11-20 05:54:36,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 05:54:36,590 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 223 [2024-11-20 05:54:36,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:54:36,590 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 05:54:36,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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) [2024-11-20 05:54:36,592 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 05:54:36,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 05:54:36,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 05:54:36,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 05:54:36,598 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:54:36,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 05:54:36,641 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 05:54:36,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:54:36 BoogieIcfgContainer [2024-11-20 05:54:36,664 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 05:54:36,665 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 05:54:36,665 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 05:54:36,665 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 05:54:36,666 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:54:17" (3/4) ... [2024-11-20 05:54:36,668 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 05:54:36,672 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-20 05:54:36,678 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-20 05:54:36,678 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-20 05:54:36,678 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 05:54:36,679 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 05:54:36,779 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 05:54:36,779 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 05:54:36,779 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 05:54:36,780 INFO L158 Benchmark]: Toolchain (without parser) took 19892.27ms. Allocated memory was 140.5MB in the beginning and 604.0MB in the end (delta: 463.5MB). Free memory was 70.0MB in the beginning and 322.1MB in the end (delta: -252.2MB). Peak memory consumption was 213.4MB. Max. memory is 16.1GB. [2024-11-20 05:54:36,780 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 140.5MB. Free memory is still 92.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:54:36,780 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.62ms. Allocated memory is still 140.5MB. Free memory was 69.6MB in the beginning and 55.6MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 05:54:36,780 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.01ms. Allocated memory is still 140.5MB. Free memory was 55.6MB in the beginning and 53.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 05:54:36,781 INFO L158 Benchmark]: Boogie Preprocessor took 42.85ms. Allocated memory is still 140.5MB. Free memory was 53.7MB in the beginning and 51.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 05:54:36,781 INFO L158 Benchmark]: RCFGBuilder took 541.27ms. Allocated memory was 140.5MB in the beginning and 186.6MB in the end (delta: 46.1MB). Free memory was 51.4MB in the beginning and 146.3MB in the end (delta: -94.9MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2024-11-20 05:54:36,781 INFO L158 Benchmark]: TraceAbstraction took 18827.25ms. Allocated memory was 186.6MB in the beginning and 604.0MB in the end (delta: 417.3MB). Free memory was 146.3MB in the beginning and 328.4MB in the end (delta: -182.1MB). Peak memory consumption was 234.1MB. Max. memory is 16.1GB. [2024-11-20 05:54:36,781 INFO L158 Benchmark]: Witness Printer took 114.55ms. Allocated memory is still 604.0MB. Free memory was 328.4MB in the beginning and 322.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 05:54:36,786 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.19ms. Allocated memory is still 140.5MB. Free memory is still 92.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.62ms. Allocated memory is still 140.5MB. Free memory was 69.6MB in the beginning and 55.6MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.01ms. Allocated memory is still 140.5MB. Free memory was 55.6MB in the beginning and 53.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.85ms. Allocated memory is still 140.5MB. Free memory was 53.7MB in the beginning and 51.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 541.27ms. Allocated memory was 140.5MB in the beginning and 186.6MB in the end (delta: 46.1MB). Free memory was 51.4MB in the beginning and 146.3MB in the end (delta: -94.9MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * TraceAbstraction took 18827.25ms. Allocated memory was 186.6MB in the beginning and 604.0MB in the end (delta: 417.3MB). Free memory was 146.3MB in the beginning and 328.4MB in the end (delta: -182.1MB). Peak memory consumption was 234.1MB. Max. memory is 16.1GB. * Witness Printer took 114.55ms. Allocated memory is still 604.0MB. Free memory was 328.4MB in the beginning and 322.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * 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, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.7s, OverallIterations: 7, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 252 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 1841 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1389 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 755 IncrementalHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 452 mSDtfsCounter, 755 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 413 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=5, InterpolantAutomatonStates: 59, 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, 103 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 1005 NumberOfCodeBlocks, 1005 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 998 ConstructedInterpolants, 0 QuantifiedInterpolants, 3481 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 8172/8172 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: 105]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_4 == \old(var_1_4))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (last_1_var_1_1 == \old(last_1_var_1_1))) && (last_1_var_1_7 == \old(last_1_var_1_7))) && (last_1_var_1_12 == \old(last_1_var_1_12))) RESULT: Ultimate proved your program to be correct! [2024-11-20 05:54:36,834 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE