./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../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-?-c7c6ca5-m [2024-11-08 23:01:15,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:01:15,085 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:01:15,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:01:15,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:01:15,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:01:15,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:01:15,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:01:15,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:01:15,130 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:01:15,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:01:15,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:01:15,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:01:15,132 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:01:15,133 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:01:15,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:01:15,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:01:15,139 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:01:15,139 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:01:15,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:01:15,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:01:15,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:01:15,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:01:15,142 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:01:15,142 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:01:15,142 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:01:15,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:01:15,143 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:01:15,143 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:01:15,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:01:15,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:01:15,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:01:15,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:01:15,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:01:15,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:01:15,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:01:15,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:01:15,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:01:15,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:01:15,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:01:15,156 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:01:15,157 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:01:15,157 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-08 23:01:15,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:01:15,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:01:15,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:01:15,445 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:01:15,445 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:01:15,447 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-59.i [2024-11-08 23:01:16,941 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:01:17,129 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:01:17,130 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-59.i [2024-11-08 23:01:17,138 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/603b30b8c/50ff310ba0cf49d49a1c9f3db7ad7795/FLAG01604cdd8 [2024-11-08 23:01:17,153 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/603b30b8c/50ff310ba0cf49d49a1c9f3db7ad7795 [2024-11-08 23:01:17,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:01:17,156 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:01:17,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:01:17,158 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:01:17,164 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:01:17,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:01:17" (1/1) ... [2024-11-08 23:01:17,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a617c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:01:17, skipping insertion in model container [2024-11-08 23:01:17,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:01:17" (1/1) ... [2024-11-08 23:01:17,199 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:01:17,372 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-08 23:01:17,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:01:17,423 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:01:17,433 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-08 23:01:17,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:01:17,473 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:01:17,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:01:17 WrapperNode [2024-11-08 23:01:17,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:01:17,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:01:17,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:01:17,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:01:17,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:01:17" (1/1) ... [2024-11-08 23:01:17,492 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:01:17" (1/1) ... [2024-11-08 23:01:17,525 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-11-08 23:01:17,526 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:01:17,527 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:01:17,527 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:01:17,527 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:01:17,552 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:01:17" (1/1) ... [2024-11-08 23:01:17,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:01:17" (1/1) ... [2024-11-08 23:01:17,559 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:01:17" (1/1) ... [2024-11-08 23:01:17,578 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-08 23:01:17,579 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:01:17" (1/1) ... [2024-11-08 23:01:17,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:01:17" (1/1) ... [2024-11-08 23:01:17,583 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:01:17" (1/1) ... [2024-11-08 23:01:17,589 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:01:17" (1/1) ... [2024-11-08 23:01:17,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:01:17" (1/1) ... [2024-11-08 23:01:17,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:01:17" (1/1) ... [2024-11-08 23:01:17,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:01:17,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:01:17,595 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:01:17,595 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:01:17,596 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:01:17" (1/1) ... [2024-11-08 23:01:17,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:01:17,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:01:17,638 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-08 23:01:17,643 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-08 23:01:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:01:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:01:17,699 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:01:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:01:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:01:17,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:01:17,771 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:01:17,773 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:01:17,986 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 23:01:17,987 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:01:18,006 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:01:18,006 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:01:18,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:01:18 BoogieIcfgContainer [2024-11-08 23:01:18,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:01:18,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:01:18,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:01:18,012 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:01:18,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:01:17" (1/3) ... [2024-11-08 23:01:18,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c41f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:01:18, skipping insertion in model container [2024-11-08 23:01:18,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:01:17" (2/3) ... [2024-11-08 23:01:18,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c41f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:01:18, skipping insertion in model container [2024-11-08 23:01:18,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:01:18" (3/3) ... [2024-11-08 23:01:18,015 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-59.i [2024-11-08 23:01:18,031 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:01:18,031 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:01:18,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:01:18,103 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;@1c3ecfbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:01:18,103 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:01:18,108 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-08 23:01:18,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 23:01:18,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:01:18,122 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-08 23:01:18,122 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:01:18,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:01:18,128 INFO L85 PathProgramCache]: Analyzing trace with hash 436534238, now seen corresponding path program 1 times [2024-11-08 23:01:18,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:01:18,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046128648] [2024-11-08 23:01:18,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:01:18,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:01:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:18,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:01:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:18,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:01:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:18,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:01:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:18,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:01:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:18,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:01:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:18,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:01:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:18,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:01:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:18,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:01:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:18,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:01:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:18,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:01:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:18,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:01:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:18,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:01:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:18,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:01:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:18,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:01:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:18,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:01:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:18,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:01:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:18,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:01:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:18,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:01:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:18,568 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-08 23:01:18,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:01:18,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046128648] [2024-11-08 23:01:18,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046128648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:01:18,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:01:18,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:01:18,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38971632] [2024-11-08 23:01:18,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:01:18,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:01:18,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:01:18,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:01:18,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:01:18,606 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-08 23:01:18,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:01:18,633 INFO L93 Difference]: Finished difference Result 97 states and 168 transitions. [2024-11-08 23:01:18,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:01:18,636 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-08 23:01:18,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:01:18,643 INFO L225 Difference]: With dead ends: 97 [2024-11-08 23:01:18,643 INFO L226 Difference]: Without dead ends: 48 [2024-11-08 23:01:18,647 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-08 23:01:18,652 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-08 23:01:18,654 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-08 23:01:18,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-08 23:01:18,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-08 23:01:18,696 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-08 23:01:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2024-11-08 23:01:18,724 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 111 [2024-11-08 23:01:18,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:01:18,726 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2024-11-08 23:01:18,727 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-08 23:01:18,727 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2024-11-08 23:01:18,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 23:01:18,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:01:18,733 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-08 23:01:18,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:01:18,734 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:01:18,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:01:18,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1117207838, now seen corresponding path program 1 times [2024-11-08 23:01:18,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:01:18,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474500722] [2024-11-08 23:01:18,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:01:18,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:01:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:19,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:01:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:19,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:01:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:19,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:01:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:19,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:01:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:19,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:01:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:19,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:01:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:19,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:01:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:19,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:01:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:19,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:01:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:19,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:01:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:19,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:01:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:19,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:01:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:19,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:01:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:19,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:01:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:19,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:01:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:19,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:01:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:19,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:01:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:19,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:01:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:19,386 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-08 23:01:19,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:01:19,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474500722] [2024-11-08 23:01:19,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474500722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:01:19,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:01:19,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:01:19,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530150256] [2024-11-08 23:01:19,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:01:19,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:01:19,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:01:19,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:01:19,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:01:19,391 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-08 23:01:19,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:01:19,627 INFO L93 Difference]: Finished difference Result 139 states and 208 transitions. [2024-11-08 23:01:19,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:01:19,628 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-08 23:01:19,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:01:19,631 INFO L225 Difference]: With dead ends: 139 [2024-11-08 23:01:19,632 INFO L226 Difference]: Without dead ends: 94 [2024-11-08 23:01:19,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:01:19,634 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.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:01:19,634 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.2s Time] [2024-11-08 23:01:19,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-08 23:01:19,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2024-11-08 23:01:19,657 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-08 23:01:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 125 transitions. [2024-11-08 23:01:19,660 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 125 transitions. Word has length 111 [2024-11-08 23:01:19,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:01:19,660 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 125 transitions. [2024-11-08 23:01:19,661 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-08 23:01:19,661 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 125 transitions. [2024-11-08 23:01:19,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 23:01:19,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:01:19,663 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-08 23:01:19,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:01:19,663 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:01:19,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:01:19,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1580942571, now seen corresponding path program 1 times [2024-11-08 23:01:19,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:01:19,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421219503] [2024-11-08 23:01:19,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:01:19,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:01:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:23,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:01:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:23,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:01:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:23,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:01:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:23,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:01:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:23,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:01:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:23,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:01:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:23,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:01:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:23,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:01:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:23,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:01:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:23,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:01:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:23,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:01:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:23,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:01:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:23,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:01:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:23,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:01:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:23,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:01:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:23,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:01:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:23,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:01:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:23,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:01:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:23,654 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-08 23:01:23,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:01:23,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421219503] [2024-11-08 23:01:23,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421219503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:01:23,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:01:23,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 23:01:23,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265841636] [2024-11-08 23:01:23,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:01:23,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 23:01:23,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:01:23,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 23:01:23,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:01:23,665 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-08 23:01:24,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:01:24,113 INFO L93 Difference]: Finished difference Result 112 states and 160 transitions. [2024-11-08 23:01:24,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 23:01:24,114 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-08 23:01:24,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:01:24,117 INFO L225 Difference]: With dead ends: 112 [2024-11-08 23:01:24,119 INFO L226 Difference]: Without dead ends: 110 [2024-11-08 23:01:24,120 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-08 23:01:24,121 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 37 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:01:24,122 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.2s Time] [2024-11-08 23:01:24,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-08 23:01:24,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 89. [2024-11-08 23:01:24,148 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-08 23:01:24,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 132 transitions. [2024-11-08 23:01:24,153 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 132 transitions. Word has length 112 [2024-11-08 23:01:24,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:01:24,154 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 132 transitions. [2024-11-08 23:01:24,154 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-08 23:01:24,154 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 132 transitions. [2024-11-08 23:01:24,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 23:01:24,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:01:24,155 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-08 23:01:24,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:01:24,156 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:01:24,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:01:24,158 INFO L85 PathProgramCache]: Analyzing trace with hash 161072197, now seen corresponding path program 1 times [2024-11-08 23:01:24,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:01:24,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524988957] [2024-11-08 23:01:24,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:01:24,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:01:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:26,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:01:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:26,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:01:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:26,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:01:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:26,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:01:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:26,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:01:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:26,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:01:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:26,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:01:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:26,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:01:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:26,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:01:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:26,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:01:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:26,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:01:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:26,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:01:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:26,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:01:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:26,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:01:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:26,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:01:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:26,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:01:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:26,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:01:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:26,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:01:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:26,888 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-08 23:01:26,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:01:26,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524988957] [2024-11-08 23:01:26,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524988957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:01:26,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:01:26,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 23:01:26,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191603024] [2024-11-08 23:01:26,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:01:26,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 23:01:26,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:01:26,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 23:01:26,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:01:26,892 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-08 23:01:27,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:01:27,352 INFO L93 Difference]: Finished difference Result 126 states and 178 transitions. [2024-11-08 23:01:27,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:01:27,353 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-08 23:01:27,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:01:27,355 INFO L225 Difference]: With dead ends: 126 [2024-11-08 23:01:27,355 INFO L226 Difference]: Without dead ends: 124 [2024-11-08 23:01:27,355 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-08 23:01:27,356 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-08 23:01:27,357 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-08 23:01:27,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-08 23:01:27,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 89. [2024-11-08 23:01:27,371 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-08 23:01:27,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 132 transitions. [2024-11-08 23:01:27,372 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 132 transitions. Word has length 113 [2024-11-08 23:01:27,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:01:27,373 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 132 transitions. [2024-11-08 23:01:27,373 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-08 23:01:27,374 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 132 transitions. [2024-11-08 23:01:27,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 23:01:27,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:01:27,375 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-08 23:01:27,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:01:27,376 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:01:27,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:01:27,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1301901591, now seen corresponding path program 1 times [2024-11-08 23:01:27,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:01:27,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044387749] [2024-11-08 23:01:27,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:01:27,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:01:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:32,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:01:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:32,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:01:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:32,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:01:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:32,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:01:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:32,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:01:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:32,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:01:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:32,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:01:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:32,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:01:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:32,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:01:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:32,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:01:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:32,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:01:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:32,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:01:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:32,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:01:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:32,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:01:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:32,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:01:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:32,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:01:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:32,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:01:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:32,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:01:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:32,760 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-08 23:01:32,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:01:32,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044387749] [2024-11-08 23:01:32,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044387749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:01:32,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:01:32,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 23:01:32,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882186711] [2024-11-08 23:01:32,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:01:32,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 23:01:32,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:01:32,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 23:01:32,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:01:32,763 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-08 23:01:33,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:01:33,631 INFO L93 Difference]: Finished difference Result 105 states and 153 transitions. [2024-11-08 23:01:33,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 23:01:33,632 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-08 23:01:33,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:01:33,634 INFO L225 Difference]: With dead ends: 105 [2024-11-08 23:01:33,634 INFO L226 Difference]: Without dead ends: 103 [2024-11-08 23:01:33,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2024-11-08 23:01:33,636 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.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:01:33,636 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.3s Time] [2024-11-08 23:01:33,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-08 23:01:33,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 90. [2024-11-08 23:01:33,656 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-08 23:01:33,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 134 transitions. [2024-11-08 23:01:33,657 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 134 transitions. Word has length 113 [2024-11-08 23:01:33,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:01:33,658 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 134 transitions. [2024-11-08 23:01:33,658 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-08 23:01:33,658 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 134 transitions. [2024-11-08 23:01:33,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-08 23:01:33,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:01:33,668 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-08 23:01:33,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:01:33,669 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:01:33,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:01:33,670 INFO L85 PathProgramCache]: Analyzing trace with hash 2008703854, now seen corresponding path program 1 times [2024-11-08 23:01:33,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:01:33,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027505385] [2024-11-08 23:01:33,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:01:33,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:01:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:01:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:01:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:01:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:01:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:01:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:01:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:01:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:01:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:01:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:01:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:01:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:01:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:01:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:01:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:01:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:01:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:01:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:01:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:01:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 23:01:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:01:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 23:01:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 23:01:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 23:01:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 23:01:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 23:01:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 23:01:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 23:01:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 23:01:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-08 23:01:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-08 23:01:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-08 23:01:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-08 23:01:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-08 23:01:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-08 23:01:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-08 23:01:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:35,629 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-08 23:01:35,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:01:35,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027505385] [2024-11-08 23:01:35,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027505385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:01:35,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:01:35,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 23:01:35,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514730012] [2024-11-08 23:01:35,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:01:35,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 23:01:35,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:01:35,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 23:01:35,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:01:35,633 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-08 23:01:36,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:01:36,124 INFO L93 Difference]: Finished difference Result 116 states and 167 transitions. [2024-11-08 23:01:36,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:01:36,124 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-08 23:01:36,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:01:36,126 INFO L225 Difference]: With dead ends: 116 [2024-11-08 23:01:36,126 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 23:01:36,127 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-08 23:01:36,127 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 45 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-08 23:01:36,128 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.4s Time] [2024-11-08 23:01:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 23:01:36,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 90. [2024-11-08 23:01:36,139 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-08 23:01:36,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 134 transitions. [2024-11-08 23:01:36,140 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 134 transitions. Word has length 222 [2024-11-08 23:01:36,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:01:36,141 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 134 transitions. [2024-11-08 23:01:36,141 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-08 23:01:36,142 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 134 transitions. [2024-11-08 23:01:36,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-08 23:01:36,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:01:36,144 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-08 23:01:36,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 23:01:36,145 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:01:36,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:01:36,145 INFO L85 PathProgramCache]: Analyzing trace with hash -926203706, now seen corresponding path program 1 times [2024-11-08 23:01:36,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:01:36,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448447319] [2024-11-08 23:01:36,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:01:36,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:01:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:01:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:01:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:01:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:01:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:01:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:01:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:01:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:01:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:01:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:01:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:01:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:01:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:01:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:01:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:01:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:01:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:01:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:01:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:01:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 23:01:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:01:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 23:01:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 23:01:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 23:01:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 23:01:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 23:01:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 23:01:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 23:01:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 23:01:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-08 23:01:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-08 23:01:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-08 23:01:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-08 23:01:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-08 23:01:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-08 23:01:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-08 23:01:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:01:38,117 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-08 23:01:38,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:01:38,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448447319] [2024-11-08 23:01:38,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448447319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:01:38,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:01:38,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 23:01:38,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781958719] [2024-11-08 23:01:38,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:01:38,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:01:38,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:01:38,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:01:38,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:01:38,121 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-08 23:01:38,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:01:38,788 INFO L93 Difference]: Finished difference Result 114 states and 165 transitions. [2024-11-08 23:01:38,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 23:01:38,788 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-08 23:01:38,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:01:38,789 INFO L225 Difference]: With dead ends: 114 [2024-11-08 23:01:38,789 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 23:01:38,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-11-08 23:01:38,791 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 49 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:01:38,791 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.2s Time] [2024-11-08 23:01:38,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 23:01:38,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 23:01:38,792 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-08 23:01:38,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 23:01:38,796 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 223 [2024-11-08 23:01:38,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:01:38,797 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 23:01:38,797 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-08 23:01:38,797 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 23:01:38,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 23:01:38,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:01:38,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 23:01:38,805 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:01:38,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 23:01:38,869 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:01:38,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:01:38 BoogieIcfgContainer [2024-11-08 23:01:38,890 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:01:38,891 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:01:38,891 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:01:38,892 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:01:38,892 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:01:18" (3/4) ... [2024-11-08 23:01:38,894 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 23:01:38,899 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-08 23:01:38,905 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-08 23:01:38,906 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 23:01:38,906 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 23:01:38,906 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 23:01:38,999 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 23:01:39,000 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 23:01:39,000 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:01:39,001 INFO L158 Benchmark]: Toolchain (without parser) took 21844.39ms. Allocated memory was 176.2MB in the beginning and 704.6MB in the end (delta: 528.5MB). Free memory was 120.3MB in the beginning and 255.2MB in the end (delta: -135.0MB). Peak memory consumption was 397.5MB. Max. memory is 16.1GB. [2024-11-08 23:01:39,001 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:01:39,001 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.78ms. Allocated memory is still 176.2MB. Free memory was 120.3MB in the beginning and 106.4MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:01:39,002 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.84ms. Allocated memory is still 176.2MB. Free memory was 106.0MB in the beginning and 104.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:01:39,002 INFO L158 Benchmark]: Boogie Preprocessor took 67.30ms. Allocated memory is still 176.2MB. Free memory was 104.3MB in the beginning and 102.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:01:39,002 INFO L158 Benchmark]: RCFGBuilder took 412.30ms. Allocated memory is still 176.2MB. Free memory was 101.8MB in the beginning and 86.8MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:01:39,002 INFO L158 Benchmark]: TraceAbstraction took 20881.86ms. Allocated memory was 176.2MB in the beginning and 704.6MB in the end (delta: 528.5MB). Free memory was 86.0MB in the beginning and 261.5MB in the end (delta: -175.6MB). Peak memory consumption was 355.5MB. Max. memory is 16.1GB. [2024-11-08 23:01:39,003 INFO L158 Benchmark]: Witness Printer took 109.07ms. Allocated memory is still 704.6MB. Free memory was 261.5MB in the beginning and 255.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:01:39,004 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.20ms. Allocated memory is still 176.2MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.78ms. Allocated memory is still 176.2MB. Free memory was 120.3MB in the beginning and 106.4MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.84ms. Allocated memory is still 176.2MB. Free memory was 106.0MB in the beginning and 104.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 67.30ms. Allocated memory is still 176.2MB. Free memory was 104.3MB in the beginning and 102.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 412.30ms. Allocated memory is still 176.2MB. Free memory was 101.8MB in the beginning and 86.8MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 20881.86ms. Allocated memory was 176.2MB in the beginning and 704.6MB in the end (delta: 528.5MB). Free memory was 86.0MB in the beginning and 261.5MB in the end (delta: -175.6MB). Peak memory consumption was 355.5MB. Max. memory is 16.1GB. * Witness Printer took 109.07ms. Allocated memory is still 704.6MB. Free memory was 261.5MB in the beginning and 255.2MB 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: 20.7s, OverallIterations: 7, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 252 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 1841 SdHoareTripleChecker+Invalid, 1.3s 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, 3.0s 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.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 103 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 16.7s 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-08 23:01:39,061 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