./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label08.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f3f9b9f-20b5-4f86-910a-a8f1a9cf6d81/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f3f9b9f-20b5-4f86-910a-a8f1a9cf6d81/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f3f9b9f-20b5-4f86-910a-a8f1a9cf6d81/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f3f9b9f-20b5-4f86-910a-a8f1a9cf6d81/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label08.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f3f9b9f-20b5-4f86-910a-a8f1a9cf6d81/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f3f9b9f-20b5-4f86-910a-a8f1a9cf6d81/bin/uautomizer-verify-qhAvR1uOyd --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 83003e08d0b0727d8396cfdc2be95d1bd0956c017aa98740983eff57678f4a43 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:47:52,828 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:47:52,940 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f3f9b9f-20b5-4f86-910a-a8f1a9cf6d81/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 13:47:52,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:47:52,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:47:52,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:47:52,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:47:52,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:47:52,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:47:52,982 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:47:52,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:47:52,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:47:52,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:47:52,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:47:52,983 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:47:52,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:47:52,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:47:52,984 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:47:52,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:47:52,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:47:52,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:47:52,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:47:52,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:47:52,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:47:52,985 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:47:52,985 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:47:52,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:47:52,986 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:47:52,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:47:52,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:47:52,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:47:52,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:47:52,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:47:52,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:47:52,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:47:52,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:47:52,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:47:52,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:47:52,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:47:52,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:47:52,988 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:47:52,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:47:52,988 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f3f9b9f-20b5-4f86-910a-a8f1a9cf6d81/bin/uautomizer-verify-qhAvR1uOyd 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 -> 83003e08d0b0727d8396cfdc2be95d1bd0956c017aa98740983eff57678f4a43 [2024-11-13 13:47:53,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:47:53,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:47:53,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:47:53,393 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:47:53,394 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:47:53,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f3f9b9f-20b5-4f86-910a-a8f1a9cf6d81/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/eca-rers2012/Problem02_label08.c Unable to find full path for "g++" [2024-11-13 13:47:55,663 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:47:56,097 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:47:56,098 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f3f9b9f-20b5-4f86-910a-a8f1a9cf6d81/sv-benchmarks/c/eca-rers2012/Problem02_label08.c [2024-11-13 13:47:56,125 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f3f9b9f-20b5-4f86-910a-a8f1a9cf6d81/bin/uautomizer-verify-qhAvR1uOyd/data/2b3e0d24e/97b06fcc832b4964891a8b1256a55856/FLAG402093a41 [2024-11-13 13:47:56,153 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f3f9b9f-20b5-4f86-910a-a8f1a9cf6d81/bin/uautomizer-verify-qhAvR1uOyd/data/2b3e0d24e/97b06fcc832b4964891a8b1256a55856 [2024-11-13 13:47:56,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:47:56,157 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:47:56,159 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:47:56,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:47:56,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:47:56,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:47:56" (1/1) ... [2024-11-13 13:47:56,170 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a04b39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:56, skipping insertion in model container [2024-11-13 13:47:56,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:47:56" (1/1) ... [2024-11-13 13:47:56,237 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:47:56,650 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f3f9b9f-20b5-4f86-910a-a8f1a9cf6d81/sv-benchmarks/c/eca-rers2012/Problem02_label08.c[19283,19296] [2024-11-13 13:47:56,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:47:56,724 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:47:56,886 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f3f9b9f-20b5-4f86-910a-a8f1a9cf6d81/sv-benchmarks/c/eca-rers2012/Problem02_label08.c[19283,19296] [2024-11-13 13:47:56,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:47:56,937 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:47:56,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:56 WrapperNode [2024-11-13 13:47:56,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:47:56,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:47:56,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:47:56,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:47:56,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:56" (1/1) ... [2024-11-13 13:47:56,973 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:56" (1/1) ... [2024-11-13 13:47:57,035 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-13 13:47:57,036 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:47:57,036 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:47:57,037 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:47:57,037 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:47:57,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:56" (1/1) ... [2024-11-13 13:47:57,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:56" (1/1) ... [2024-11-13 13:47:57,054 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:56" (1/1) ... [2024-11-13 13:47:57,092 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-13 13:47:57,096 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:56" (1/1) ... [2024-11-13 13:47:57,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:56" (1/1) ... [2024-11-13 13:47:57,135 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:56" (1/1) ... [2024-11-13 13:47:57,155 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:56" (1/1) ... [2024-11-13 13:47:57,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:56" (1/1) ... [2024-11-13 13:47:57,170 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:56" (1/1) ... [2024-11-13 13:47:57,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:47:57,181 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:47:57,182 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:47:57,182 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:47:57,184 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:56" (1/1) ... [2024-11-13 13:47:57,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:47:57,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f3f9b9f-20b5-4f86-910a-a8f1a9cf6d81/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:47:57,240 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f3f9b9f-20b5-4f86-910a-a8f1a9cf6d81/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:47:57,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f3f9b9f-20b5-4f86-910a-a8f1a9cf6d81/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:47:57,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:47:57,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:47:57,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:47:57,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:47:57,358 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:47:57,360 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:47:58,973 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-13 13:47:58,973 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:47:59,002 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:47:59,006 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:47:59,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:47:59 BoogieIcfgContainer [2024-11-13 13:47:59,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:47:59,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:47:59,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:47:59,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:47:59,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:47:56" (1/3) ... [2024-11-13 13:47:59,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26183b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:47:59, skipping insertion in model container [2024-11-13 13:47:59,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:56" (2/3) ... [2024-11-13 13:47:59,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26183b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:47:59, skipping insertion in model container [2024-11-13 13:47:59,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:47:59" (3/3) ... [2024-11-13 13:47:59,020 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label08.c [2024-11-13 13:47:59,042 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:47:59,045 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label08.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:47:59,131 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:47:59,143 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;@15579bfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:47:59,144 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:47:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 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-13 13:47:59,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 13:47:59,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:47:59,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 13:47:59,162 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:47:59,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:47:59,170 INFO L85 PathProgramCache]: Analyzing trace with hash 369350125, now seen corresponding path program 1 times [2024-11-13 13:47:59,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:47:59,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867763880] [2024-11-13 13:47:59,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:47:59,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:47:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:48:00,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:48:00,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:48:00,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867763880] [2024-11-13 13:48:00,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867763880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:48:00,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:48:00,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:48:00,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110950576] [2024-11-13 13:48:00,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:48:00,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:48:00,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:48:00,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:48:00,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:48:00,105 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 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) Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 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-13 13:48:01,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:48:01,374 INFO L93 Difference]: Finished difference Result 596 states and 1030 transitions. [2024-11-13 13:48:01,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:48:01,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 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) Word has length 122 [2024-11-13 13:48:01,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:48:01,397 INFO L225 Difference]: With dead ends: 596 [2024-11-13 13:48:01,397 INFO L226 Difference]: Without dead ends: 305 [2024-11-13 13:48:01,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:48:01,407 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 122 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:48:01,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 89 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 13:48:01,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-13 13:48:01,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-11-13 13:48:01,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.5263157894736843) internal successors, (464), 304 states have internal predecessors, (464), 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-13 13:48:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 464 transitions. [2024-11-13 13:48:01,479 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 464 transitions. Word has length 122 [2024-11-13 13:48:01,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:48:01,480 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 464 transitions. [2024-11-13 13:48:01,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 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-13 13:48:01,480 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 464 transitions. [2024-11-13 13:48:01,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 13:48:01,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:48:01,484 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 13:48:01,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:48:01,485 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:48:01,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:48:01,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1101241912, now seen corresponding path program 1 times [2024-11-13 13:48:01,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:48:01,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280648126] [2024-11-13 13:48:01,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:48:01,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:48:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:48:01,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:48:01,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:48:01,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280648126] [2024-11-13 13:48:01,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280648126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:48:01,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:48:01,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:48:01,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421497502] [2024-11-13 13:48:01,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:48:01,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:48:01,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:48:01,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:48:01,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:48:01,861 INFO L87 Difference]: Start difference. First operand 305 states and 464 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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-13 13:48:02,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:48:02,306 INFO L93 Difference]: Finished difference Result 599 states and 913 transitions. [2024-11-13 13:48:02,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:48:02,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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) Word has length 133 [2024-11-13 13:48:02,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:48:02,310 INFO L225 Difference]: With dead ends: 599 [2024-11-13 13:48:02,310 INFO L226 Difference]: Without dead ends: 296 [2024-11-13 13:48:02,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:48:02,317 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 202 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:48:02,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 23 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:48:02,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-13 13:48:02,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2024-11-13 13:48:02,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 1.4271186440677965) internal successors, (421), 295 states have internal predecessors, (421), 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-13 13:48:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 421 transitions. [2024-11-13 13:48:02,352 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 421 transitions. Word has length 133 [2024-11-13 13:48:02,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:48:02,352 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 421 transitions. [2024-11-13 13:48:02,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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-13 13:48:02,353 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 421 transitions. [2024-11-13 13:48:02,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 13:48:02,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:48:02,359 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 13:48:02,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:48:02,359 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:48:02,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:48:02,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1256133518, now seen corresponding path program 1 times [2024-11-13 13:48:02,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:48:02,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808905471] [2024-11-13 13:48:02,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:48:02,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:48:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:48:02,694 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:48:02,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:48:02,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808905471] [2024-11-13 13:48:02,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808905471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:48:02,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:48:02,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:48:02,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881033236] [2024-11-13 13:48:02,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:48:02,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:48:02,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:48:02,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:48:02,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:48:02,699 INFO L87 Difference]: Start difference. First operand 296 states and 421 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 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-13 13:48:03,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:48:03,387 INFO L93 Difference]: Finished difference Result 880 states and 1254 transitions. [2024-11-13 13:48:03,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:48:03,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 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) Word has length 140 [2024-11-13 13:48:03,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:48:03,391 INFO L225 Difference]: With dead ends: 880 [2024-11-13 13:48:03,391 INFO L226 Difference]: Without dead ends: 586 [2024-11-13 13:48:03,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:48:03,394 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 148 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:48:03,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 79 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:48:03,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2024-11-13 13:48:03,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 581. [2024-11-13 13:48:03,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 1.3758620689655172) internal successors, (798), 580 states have internal predecessors, (798), 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-13 13:48:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 798 transitions. [2024-11-13 13:48:03,426 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 798 transitions. Word has length 140 [2024-11-13 13:48:03,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:48:03,426 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 798 transitions. [2024-11-13 13:48:03,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 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-13 13:48:03,427 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 798 transitions. [2024-11-13 13:48:03,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 13:48:03,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:48:03,430 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 13:48:03,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:48:03,431 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:48:03,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:48:03,432 INFO L85 PathProgramCache]: Analyzing trace with hash -596948423, now seen corresponding path program 1 times [2024-11-13 13:48:03,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:48:03,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632359792] [2024-11-13 13:48:03,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:48:03,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:48:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:48:03,607 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:48:03,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:48:03,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632359792] [2024-11-13 13:48:03,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632359792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:48:03,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:48:03,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:48:03,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244665811] [2024-11-13 13:48:03,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:48:03,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:48:03,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:48:03,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:48:03,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:48:03,610 INFO L87 Difference]: Start difference. First operand 581 states and 798 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-13 13:48:04,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:48:04,301 INFO L93 Difference]: Finished difference Result 1443 states and 1982 transitions. [2024-11-13 13:48:04,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:48:04,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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) Word has length 144 [2024-11-13 13:48:04,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:48:04,305 INFO L225 Difference]: With dead ends: 1443 [2024-11-13 13:48:04,305 INFO L226 Difference]: Without dead ends: 580 [2024-11-13 13:48:04,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:48:04,308 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 129 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:48:04,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 239 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:48:04,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-11-13 13:48:04,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 439. [2024-11-13 13:48:04,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 1.2077625570776256) internal successors, (529), 438 states have internal predecessors, (529), 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-13 13:48:04,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 529 transitions. [2024-11-13 13:48:04,323 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 529 transitions. Word has length 144 [2024-11-13 13:48:04,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:48:04,323 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 529 transitions. [2024-11-13 13:48:04,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-13 13:48:04,324 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 529 transitions. [2024-11-13 13:48:04,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 13:48:04,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:48:04,326 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 13:48:04,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:48:04,327 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:48:04,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:48:04,327 INFO L85 PathProgramCache]: Analyzing trace with hash 338830980, now seen corresponding path program 1 times [2024-11-13 13:48:04,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:48:04,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593313] [2024-11-13 13:48:04,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:48:04,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:48:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:48:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:48:04,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:48:04,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593313] [2024-11-13 13:48:04,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:48:04,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:48:04,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:48:04,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856312155] [2024-11-13 13:48:04,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:48:04,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:48:04,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:48:04,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:48:04,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:48:04,520 INFO L87 Difference]: Start difference. First operand 439 states and 529 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 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-13 13:48:05,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:48:05,139 INFO L93 Difference]: Finished difference Result 1296 states and 1565 transitions. [2024-11-13 13:48:05,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:48:05,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 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) Word has length 144 [2024-11-13 13:48:05,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:48:05,144 INFO L225 Difference]: With dead ends: 1296 [2024-11-13 13:48:05,144 INFO L226 Difference]: Without dead ends: 859 [2024-11-13 13:48:05,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:48:05,147 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 154 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:48:05,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 51 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:48:05,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2024-11-13 13:48:05,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 719. [2024-11-13 13:48:05,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 718 states have (on average 1.200557103064067) internal successors, (862), 718 states have internal predecessors, (862), 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-13 13:48:05,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 862 transitions. [2024-11-13 13:48:05,179 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 862 transitions. Word has length 144 [2024-11-13 13:48:05,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:48:05,179 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 862 transitions. [2024-11-13 13:48:05,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 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-13 13:48:05,180 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 862 transitions. [2024-11-13 13:48:05,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-13 13:48:05,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:48:05,183 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 13:48:05,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 13:48:05,183 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:48:05,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:48:05,184 INFO L85 PathProgramCache]: Analyzing trace with hash -564547506, now seen corresponding path program 1 times [2024-11-13 13:48:05,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:48:05,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963827649] [2024-11-13 13:48:05,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:48:05,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:48:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:48:05,560 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 13:48:05,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:48:05,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963827649] [2024-11-13 13:48:05,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963827649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:48:05,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:48:05,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:48:05,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078881808] [2024-11-13 13:48:05,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:48:05,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:48:05,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:48:05,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:48:05,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:48:05,562 INFO L87 Difference]: Start difference. First operand 719 states and 862 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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-13 13:48:06,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:48:06,165 INFO L93 Difference]: Finished difference Result 1717 states and 2035 transitions. [2024-11-13 13:48:06,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:48:06,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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) Word has length 149 [2024-11-13 13:48:06,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:48:06,172 INFO L225 Difference]: With dead ends: 1717 [2024-11-13 13:48:06,173 INFO L226 Difference]: Without dead ends: 860 [2024-11-13 13:48:06,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:48:06,175 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 28 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:48:06,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 218 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:48:06,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2024-11-13 13:48:06,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 859. [2024-11-13 13:48:06,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 858 states have (on average 1.1736596736596736) internal successors, (1007), 858 states have internal predecessors, (1007), 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-13 13:48:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1007 transitions. [2024-11-13 13:48:06,229 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1007 transitions. Word has length 149 [2024-11-13 13:48:06,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:48:06,230 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1007 transitions. [2024-11-13 13:48:06,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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-13 13:48:06,230 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1007 transitions. [2024-11-13 13:48:06,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-13 13:48:06,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:48:06,236 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 13:48:06,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 13:48:06,236 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:48:06,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:48:06,237 INFO L85 PathProgramCache]: Analyzing trace with hash 367784632, now seen corresponding path program 1 times [2024-11-13 13:48:06,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:48:06,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049831751] [2024-11-13 13:48:06,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:48:06,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:48:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:48:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 13:48:06,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:48:06,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049831751] [2024-11-13 13:48:06,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049831751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:48:06,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:48:06,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:48:06,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396526690] [2024-11-13 13:48:06,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:48:06,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:48:06,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:48:06,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:48:06,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:48:06,495 INFO L87 Difference]: Start difference. First operand 859 states and 1007 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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-13 13:48:07,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:48:07,100 INFO L93 Difference]: Finished difference Result 2136 states and 2499 transitions. [2024-11-13 13:48:07,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:48:07,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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) Word has length 189 [2024-11-13 13:48:07,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:48:07,108 INFO L225 Difference]: With dead ends: 2136 [2024-11-13 13:48:07,109 INFO L226 Difference]: Without dead ends: 1279 [2024-11-13 13:48:07,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:48:07,111 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 113 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:48:07,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 216 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:48:07,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2024-11-13 13:48:07,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2024-11-13 13:48:07,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1279 states, 1278 states have (on average 1.124413145539906) internal successors, (1437), 1278 states have internal predecessors, (1437), 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-13 13:48:07,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1437 transitions. [2024-11-13 13:48:07,155 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1437 transitions. Word has length 189 [2024-11-13 13:48:07,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:48:07,155 INFO L471 AbstractCegarLoop]: Abstraction has 1279 states and 1437 transitions. [2024-11-13 13:48:07,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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-13 13:48:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1437 transitions. [2024-11-13 13:48:07,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 13:48:07,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:48:07,160 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 13:48:07,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 13:48:07,161 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:48:07,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:48:07,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1454427851, now seen corresponding path program 1 times [2024-11-13 13:48:07,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:48:07,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285800384] [2024-11-13 13:48:07,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:48:07,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:48:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:48:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:48:07,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:48:07,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285800384] [2024-11-13 13:48:07,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285800384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:48:07,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:48:07,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:48:07,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599616021] [2024-11-13 13:48:07,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:48:07,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:48:07,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:48:07,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:48:07,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:48:07,722 INFO L87 Difference]: Start difference. First operand 1279 states and 1437 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 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-13 13:48:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:48:08,495 INFO L93 Difference]: Finished difference Result 2697 states and 3034 transitions. [2024-11-13 13:48:08,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:48:08,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 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) Word has length 190 [2024-11-13 13:48:08,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:48:08,501 INFO L225 Difference]: With dead ends: 2697 [2024-11-13 13:48:08,502 INFO L226 Difference]: Without dead ends: 1420 [2024-11-13 13:48:08,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-13 13:48:08,504 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 101 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:48:08,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 91 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 13:48:08,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2024-11-13 13:48:08,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1419. [2024-11-13 13:48:08,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 1418 states have (on average 1.1156558533145275) internal successors, (1582), 1418 states have internal predecessors, (1582), 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-13 13:48:08,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 1582 transitions. [2024-11-13 13:48:08,546 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 1582 transitions. Word has length 190 [2024-11-13 13:48:08,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:48:08,546 INFO L471 AbstractCegarLoop]: Abstraction has 1419 states and 1582 transitions. [2024-11-13 13:48:08,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 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-13 13:48:08,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 1582 transitions. [2024-11-13 13:48:08,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-13 13:48:08,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:48:08,552 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 13:48:08,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 13:48:08,553 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:48:08,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:48:08,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1109917375, now seen corresponding path program 1 times [2024-11-13 13:48:08,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:48:08,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986986539] [2024-11-13 13:48:08,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:48:08,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:48:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:48:09,069 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:48:09,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:48:09,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986986539] [2024-11-13 13:48:09,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986986539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:48:09,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:48:09,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:48:09,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323047004] [2024-11-13 13:48:09,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:48:09,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:48:09,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:48:09,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:48:09,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:48:09,073 INFO L87 Difference]: Start difference. First operand 1419 states and 1582 transitions. Second operand has 5 states, 5 states have (on average 39.0) internal successors, (195), 4 states have internal predecessors, (195), 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-13 13:48:10,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:48:10,233 INFO L93 Difference]: Finished difference Result 3256 states and 3673 transitions. [2024-11-13 13:48:10,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:48:10,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 4 states have internal predecessors, (195), 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) Word has length 195 [2024-11-13 13:48:10,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:48:10,245 INFO L225 Difference]: With dead ends: 3256 [2024-11-13 13:48:10,246 INFO L226 Difference]: Without dead ends: 1419 [2024-11-13 13:48:10,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:48:10,250 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 285 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:48:10,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 83 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 13:48:10,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2024-11-13 13:48:10,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1137. [2024-11-13 13:48:10,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 1136 states have (on average 1.0774647887323943) internal successors, (1224), 1136 states have internal predecessors, (1224), 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-13 13:48:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1224 transitions. [2024-11-13 13:48:10,292 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1224 transitions. Word has length 195 [2024-11-13 13:48:10,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:48:10,293 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1224 transitions. [2024-11-13 13:48:10,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 4 states have internal predecessors, (195), 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-13 13:48:10,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1224 transitions. [2024-11-13 13:48:10,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-13 13:48:10,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:48:10,298 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 13:48:10,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 13:48:10,298 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:48:10,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:48:10,299 INFO L85 PathProgramCache]: Analyzing trace with hash -277527877, now seen corresponding path program 1 times [2024-11-13 13:48:10,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:48:10,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154287448] [2024-11-13 13:48:10,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:48:10,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:48:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:48:10,579 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 13:48:10,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:48:10,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154287448] [2024-11-13 13:48:10,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154287448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:48:10,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:48:10,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:48:10,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398268879] [2024-11-13 13:48:10,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:48:10,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:48:10,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:48:10,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:48:10,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:48:10,582 INFO L87 Difference]: Start difference. First operand 1137 states and 1224 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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-13 13:48:11,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:48:11,163 INFO L93 Difference]: Finished difference Result 2694 states and 2933 transitions. [2024-11-13 13:48:11,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:48:11,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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) Word has length 210 [2024-11-13 13:48:11,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:48:11,171 INFO L225 Difference]: With dead ends: 2694 [2024-11-13 13:48:11,171 INFO L226 Difference]: Without dead ends: 1699 [2024-11-13 13:48:11,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:48:11,174 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 130 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:48:11,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 176 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:48:11,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2024-11-13 13:48:11,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1698. [2024-11-13 13:48:11,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1697 states have (on average 1.0771950500883913) internal successors, (1828), 1697 states have internal predecessors, (1828), 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-13 13:48:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 1828 transitions. [2024-11-13 13:48:11,226 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 1828 transitions. Word has length 210 [2024-11-13 13:48:11,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:48:11,226 INFO L471 AbstractCegarLoop]: Abstraction has 1698 states and 1828 transitions. [2024-11-13 13:48:11,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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-13 13:48:11,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 1828 transitions. [2024-11-13 13:48:11,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-13 13:48:11,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:48:11,233 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 13:48:11,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 13:48:11,233 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:48:11,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:48:11,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1852537288, now seen corresponding path program 1 times [2024-11-13 13:48:11,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:48:11,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616263246] [2024-11-13 13:48:11,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:48:11,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:48:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:48:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 13:48:11,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:48:11,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616263246] [2024-11-13 13:48:11,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616263246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:48:11,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:48:11,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:48:11,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047269982] [2024-11-13 13:48:11,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:48:11,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:48:11,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:48:11,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:48:11,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:48:11,903 INFO L87 Difference]: Start difference. First operand 1698 states and 1828 transitions. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 3 states have internal predecessors, (192), 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-13 13:48:12,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:48:12,462 INFO L93 Difference]: Finished difference Result 1924 states and 2054 transitions. [2024-11-13 13:48:12,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:48:12,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 3 states have internal predecessors, (192), 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) Word has length 220 [2024-11-13 13:48:12,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:48:12,470 INFO L225 Difference]: With dead ends: 1924 [2024-11-13 13:48:12,470 INFO L226 Difference]: Without dead ends: 1698 [2024-11-13 13:48:12,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:48:12,472 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 114 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:48:12,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 36 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:48:12,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2024-11-13 13:48:12,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1698. [2024-11-13 13:48:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1697 states have (on average 1.0718915733647614) internal successors, (1819), 1697 states have internal predecessors, (1819), 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-13 13:48:12,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 1819 transitions. [2024-11-13 13:48:12,524 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 1819 transitions. Word has length 220 [2024-11-13 13:48:12,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:48:12,525 INFO L471 AbstractCegarLoop]: Abstraction has 1698 states and 1819 transitions. [2024-11-13 13:48:12,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 3 states have internal predecessors, (192), 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-13 13:48:12,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 1819 transitions. [2024-11-13 13:48:12,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-13 13:48:12,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:48:12,531 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 13:48:12,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 13:48:12,531 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:48:12,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:48:12,532 INFO L85 PathProgramCache]: Analyzing trace with hash 2085038755, now seen corresponding path program 1 times [2024-11-13 13:48:12,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:48:12,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779628422] [2024-11-13 13:48:12,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:48:12,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:48:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:48:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 13:48:12,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:48:12,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779628422] [2024-11-13 13:48:12,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779628422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:48:12,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:48:12,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:48:12,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465294179] [2024-11-13 13:48:12,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:48:12,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:48:12,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:48:12,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:48:12,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:48:12,801 INFO L87 Difference]: Start difference. First operand 1698 states and 1819 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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-13 13:48:13,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:48:13,357 INFO L93 Difference]: Finished difference Result 3674 states and 3940 transitions. [2024-11-13 13:48:13,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:48:13,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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) Word has length 233 [2024-11-13 13:48:13,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:48:13,367 INFO L225 Difference]: With dead ends: 3674 [2024-11-13 13:48:13,367 INFO L226 Difference]: Without dead ends: 2118 [2024-11-13 13:48:13,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:48:13,370 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 126 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:48:13,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 191 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:48:13,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2024-11-13 13:48:13,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 1838. [2024-11-13 13:48:13,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.0707675557974958) internal successors, (1967), 1837 states have internal predecessors, (1967), 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-13 13:48:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1967 transitions. [2024-11-13 13:48:13,426 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1967 transitions. Word has length 233 [2024-11-13 13:48:13,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:48:13,427 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 1967 transitions. [2024-11-13 13:48:13,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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-13 13:48:13,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1967 transitions. [2024-11-13 13:48:13,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-13 13:48:13,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:48:13,434 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 13:48:13,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 13:48:13,435 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:48:13,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:48:13,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1956897635, now seen corresponding path program 1 times [2024-11-13 13:48:13,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:48:13,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857984770] [2024-11-13 13:48:13,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:48:13,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:48:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:48:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 13:48:13,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:48:13,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857984770] [2024-11-13 13:48:13,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857984770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:48:13,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:48:13,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:48:13,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992465610] [2024-11-13 13:48:13,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:48:13,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:48:13,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:48:13,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:48:13,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:48:13,781 INFO L87 Difference]: Start difference. First operand 1838 states and 1967 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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-13 13:48:14,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:48:14,375 INFO L93 Difference]: Finished difference Result 3675 states and 3937 transitions. [2024-11-13 13:48:14,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:48:14,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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) Word has length 268 [2024-11-13 13:48:14,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:48:14,384 INFO L225 Difference]: With dead ends: 3675 [2024-11-13 13:48:14,384 INFO L226 Difference]: Without dead ends: 1696 [2024-11-13 13:48:14,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:48:14,387 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 119 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:48:14,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 56 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:48:14,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2024-11-13 13:48:14,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1416. [2024-11-13 13:48:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1415 states have (on average 1.046643109540636) internal successors, (1481), 1415 states have internal predecessors, (1481), 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-13 13:48:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1481 transitions. [2024-11-13 13:48:14,434 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 1481 transitions. Word has length 268 [2024-11-13 13:48:14,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:48:14,434 INFO L471 AbstractCegarLoop]: Abstraction has 1416 states and 1481 transitions. [2024-11-13 13:48:14,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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-13 13:48:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1481 transitions. [2024-11-13 13:48:14,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-13 13:48:14,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:48:14,442 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 13:48:14,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 13:48:14,442 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:48:14,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:48:14,443 INFO L85 PathProgramCache]: Analyzing trace with hash -175015763, now seen corresponding path program 1 times [2024-11-13 13:48:14,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:48:14,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579328045] [2024-11-13 13:48:14,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:48:14,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:48:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:48:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:48:14,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:48:14,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579328045] [2024-11-13 13:48:14,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579328045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:48:14,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:48:14,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:48:14,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586956128] [2024-11-13 13:48:14,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:48:14,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:48:14,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:48:14,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:48:14,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:48:14,940 INFO L87 Difference]: Start difference. First operand 1416 states and 1481 transitions. Second operand has 4 states, 4 states have (on average 68.25) internal successors, (273), 4 states have internal predecessors, (273), 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-13 13:48:15,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:48:15,480 INFO L93 Difference]: Finished difference Result 3112 states and 3250 transitions. [2024-11-13 13:48:15,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:48:15,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.25) internal successors, (273), 4 states have internal predecessors, (273), 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) Word has length 273 [2024-11-13 13:48:15,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:48:15,486 INFO L225 Difference]: With dead ends: 3112 [2024-11-13 13:48:15,486 INFO L226 Difference]: Without dead ends: 993 [2024-11-13 13:48:15,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:48:15,489 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 177 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:48:15,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 192 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:48:15,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2024-11-13 13:48:15,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 992. [2024-11-13 13:48:15,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 991 states have (on average 1.0332996972754793) internal successors, (1024), 991 states have internal predecessors, (1024), 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-13 13:48:15,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1024 transitions. [2024-11-13 13:48:15,525 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1024 transitions. Word has length 273 [2024-11-13 13:48:15,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:48:15,526 INFO L471 AbstractCegarLoop]: Abstraction has 992 states and 1024 transitions. [2024-11-13 13:48:15,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.25) internal successors, (273), 4 states have internal predecessors, (273), 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-13 13:48:15,526 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1024 transitions. [2024-11-13 13:48:15,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-11-13 13:48:15,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:48:15,533 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 13:48:15,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 13:48:15,533 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:48:15,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:48:15,534 INFO L85 PathProgramCache]: Analyzing trace with hash -748262192, now seen corresponding path program 1 times [2024-11-13 13:48:15,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:48:15,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864231523] [2024-11-13 13:48:15,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:48:15,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:48:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:48:16,027 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-13 13:48:16,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:48:16,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864231523] [2024-11-13 13:48:16,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864231523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:48:16,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:48:16,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:48:16,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259370646] [2024-11-13 13:48:16,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:48:16,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:48:16,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:48:16,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:48:16,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:48:16,031 INFO L87 Difference]: Start difference. First operand 992 states and 1024 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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-13 13:48:16,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:48:16,520 INFO L93 Difference]: Finished difference Result 1415 states and 1467 transitions. [2024-11-13 13:48:16,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:48:16,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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) Word has length 325 [2024-11-13 13:48:16,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:48:16,522 INFO L225 Difference]: With dead ends: 1415 [2024-11-13 13:48:16,522 INFO L226 Difference]: Without dead ends: 0 [2024-11-13 13:48:16,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:48:16,526 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 79 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:48:16,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 17 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:48:16,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-13 13:48:16,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-13 13:48:16,528 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-13 13:48:16,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-13 13:48:16,528 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 325 [2024-11-13 13:48:16,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:48:16,528 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 13:48:16,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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-13 13:48:16,528 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-13 13:48:16,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 13:48:16,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 13:48:16,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 13:48:16,537 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:48:16,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-13 13:48:16,973 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:48:16,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:48:16 BoogieIcfgContainer [2024-11-13 13:48:16,999 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:48:17,000 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:48:17,000 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:48:17,000 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:48:17,001 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:47:59" (3/4) ... [2024-11-13 13:48:17,006 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 13:48:17,035 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-13 13:48:17,036 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-13 13:48:17,037 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 13:48:17,037 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 13:48:17,237 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f3f9b9f-20b5-4f86-910a-a8f1a9cf6d81/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 13:48:17,238 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f3f9b9f-20b5-4f86-910a-a8f1a9cf6d81/bin/uautomizer-verify-qhAvR1uOyd/witness.yml [2024-11-13 13:48:17,238 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:48:17,239 INFO L158 Benchmark]: Toolchain (without parser) took 21082.11ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 92.8MB in the beginning and 349.3MB in the end (delta: -256.5MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. [2024-11-13 13:48:17,239 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 167.8MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:48:17,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 779.27ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 66.9MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 13:48:17,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.92ms. Allocated memory is still 117.4MB. Free memory was 66.9MB in the beginning and 61.8MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:48:17,240 INFO L158 Benchmark]: Boogie Preprocessor took 144.08ms. Allocated memory is still 117.4MB. Free memory was 61.8MB in the beginning and 57.4MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:48:17,240 INFO L158 Benchmark]: RCFGBuilder took 1825.53ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 57.1MB in the beginning and 312.5MB in the end (delta: -255.5MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. [2024-11-13 13:48:17,241 INFO L158 Benchmark]: TraceAbstraction took 17989.62ms. Allocated memory was 352.3MB in the beginning and 427.8MB in the end (delta: 75.5MB). Free memory was 311.9MB in the beginning and 361.9MB in the end (delta: -50.0MB). Peak memory consumption was 239.7MB. Max. memory is 16.1GB. [2024-11-13 13:48:17,243 INFO L158 Benchmark]: Witness Printer took 238.03ms. Allocated memory is still 427.8MB. Free memory was 361.9MB in the beginning and 349.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:48:17,246 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.76ms. Allocated memory is still 167.8MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 779.27ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 66.9MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.92ms. Allocated memory is still 117.4MB. Free memory was 66.9MB in the beginning and 61.8MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 144.08ms. Allocated memory is still 117.4MB. Free memory was 61.8MB in the beginning and 57.4MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1825.53ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 57.1MB in the beginning and 312.5MB in the end (delta: -255.5MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17989.62ms. Allocated memory was 352.3MB in the beginning and 427.8MB in the end (delta: 75.5MB). Free memory was 311.9MB in the beginning and 361.9MB in the end (delta: -50.0MB). Peak memory consumption was 239.7MB. Max. memory is 16.1GB. * Witness Printer took 238.03ms. Allocated memory is still 427.8MB. Free memory was 361.9MB in the beginning and 349.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. 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: 548]: 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 1 procedures, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.4s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2027 SdHoareTripleChecker+Valid, 9.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2027 mSDsluCounter, 1757 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 213 mSDsCounter, 614 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5585 IncrementalHoareTripleChecker+Invalid, 6199 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 614 mSolverCounterUnsat, 1544 mSDtfsCounter, 5585 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=12, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 1132 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 2935 NumberOfCodeBlocks, 2935 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2920 ConstructedInterpolants, 0 QuantifiedInterpolants, 7751 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 1745/1745 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: 616]: Loop Invariant Derived loop invariant: (((((((((((((9 <= a28) && (a25 == 1)) && (a11 == 1)) && (a21 == 1)) && (a17 <= 8)) && (a28 <= 10)) || ((a17 == 8) && (a11 == 1))) || ((((a17 == 8) && (a25 == 1)) && (a21 == 1)) && (a19 == 1))) || ((((a17 == 8) && (a28 <= 8)) && (a21 == 1)) && (a25 <= 0))) || (((a17 == 8) && (a21 == 1)) && (a28 <= 7))) || (((a11 == 1) && (a25 == a19)) && (a17 <= 8))) || ((((a17 == 8) && (a25 == 1)) && (a28 == 10)) && (a21 == 1))) || ((((a17 == 8) && (9 <= a28)) && (a21 == 1)) && (a19 == 1))) RESULT: Ultimate proved your program to be correct! [2024-11-13 13:48:17,289 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f3f9b9f-20b5-4f86-910a-a8f1a9cf6d81/bin/uautomizer-verify-qhAvR1uOyd/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