./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label57.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_edaf5c01-3884-487c-8eaa-14e9e3fa406c/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edaf5c01-3884-487c-8eaa-14e9e3fa406c/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_edaf5c01-3884-487c-8eaa-14e9e3fa406c/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edaf5c01-3884-487c-8eaa-14e9e3fa406c/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label57.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edaf5c01-3884-487c-8eaa-14e9e3fa406c/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_edaf5c01-3884-487c-8eaa-14e9e3fa406c/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 cd0e9e348944f288c85b96bc2a95060d4855821a916ce78d5b1c45cd9e69ad53 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:27:11,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:27:11,708 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edaf5c01-3884-487c-8eaa-14e9e3fa406c/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 16:27:11,721 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:27:11,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:27:11,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:27:11,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:27:11,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:27:11,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:27:11,775 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:27:11,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:27:11,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:27:11,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:27:11,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:27:11,778 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:27:11,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:27:11,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:27:11,780 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:27:11,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:27:11,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:27:11,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:27:11,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:27:11,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:27:11,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:27:11,781 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:27:11,781 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:27:11,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:27:11,782 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:27:11,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:27:11,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:27:11,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:27:11,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:27:11,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:27:11,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:27:11,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:27:11,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:27:11,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 16:27:11,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 16:27:11,783 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:27:11,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:27:11,783 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:27:11,783 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:27:11,783 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_edaf5c01-3884-487c-8eaa-14e9e3fa406c/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 -> cd0e9e348944f288c85b96bc2a95060d4855821a916ce78d5b1c45cd9e69ad53 [2024-11-13 16:27:12,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:27:12,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:27:12,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:27:12,200 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:27:12,200 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:27:12,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edaf5c01-3884-487c-8eaa-14e9e3fa406c/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/eca-rers2012/Problem02_label57.c Unable to find full path for "g++" [2024-11-13 16:27:14,508 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:27:14,926 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:27:14,927 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edaf5c01-3884-487c-8eaa-14e9e3fa406c/sv-benchmarks/c/eca-rers2012/Problem02_label57.c [2024-11-13 16:27:14,943 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edaf5c01-3884-487c-8eaa-14e9e3fa406c/bin/uautomizer-verify-qhAvR1uOyd/data/aacd50da8/b9cbc0af741c4074a11bb3ed2ceb30cb/FLAG000e5068d [2024-11-13 16:27:14,975 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edaf5c01-3884-487c-8eaa-14e9e3fa406c/bin/uautomizer-verify-qhAvR1uOyd/data/aacd50da8/b9cbc0af741c4074a11bb3ed2ceb30cb [2024-11-13 16:27:14,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:27:14,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:27:14,983 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:27:14,983 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:27:14,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:27:14,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:27:14" (1/1) ... [2024-11-13 16:27:14,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a50d4c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:14, skipping insertion in model container [2024-11-13 16:27:14,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:27:14" (1/1) ... [2024-11-13 16:27:15,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:27:15,515 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_edaf5c01-3884-487c-8eaa-14e9e3fa406c/sv-benchmarks/c/eca-rers2012/Problem02_label57.c[15764,15777] [2024-11-13 16:27:15,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:27:15,601 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:27:15,718 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_edaf5c01-3884-487c-8eaa-14e9e3fa406c/sv-benchmarks/c/eca-rers2012/Problem02_label57.c[15764,15777] [2024-11-13 16:27:15,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:27:15,762 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:27:15,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:15 WrapperNode [2024-11-13 16:27:15,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:27:15,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:27:15,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:27:15,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:27:15,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:15" (1/1) ... [2024-11-13 16:27:15,803 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:15" (1/1) ... [2024-11-13 16:27:15,895 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-13 16:27:15,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:27:15,896 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:27:15,896 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:27:15,896 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:27:15,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:15" (1/1) ... [2024-11-13 16:27:15,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:15" (1/1) ... [2024-11-13 16:27:15,930 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:15" (1/1) ... [2024-11-13 16:27:15,955 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 16:27:15,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:15" (1/1) ... [2024-11-13 16:27:15,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:15" (1/1) ... [2024-11-13 16:27:15,989 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:15" (1/1) ... [2024-11-13 16:27:16,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:15" (1/1) ... [2024-11-13 16:27:16,007 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:15" (1/1) ... [2024-11-13 16:27:16,011 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:15" (1/1) ... [2024-11-13 16:27:16,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:27:16,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:27:16,029 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:27:16,029 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:27:16,030 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:15" (1/1) ... [2024-11-13 16:27:16,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:27:16,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edaf5c01-3884-487c-8eaa-14e9e3fa406c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:27:16,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edaf5c01-3884-487c-8eaa-14e9e3fa406c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:27:16,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edaf5c01-3884-487c-8eaa-14e9e3fa406c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:27:16,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:27:16,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 16:27:16,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:27:16,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:27:16,251 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:27:16,253 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:27:18,017 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-13 16:27:18,018 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:27:18,049 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:27:18,049 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:27:18,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:27:18 BoogieIcfgContainer [2024-11-13 16:27:18,050 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:27:18,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:27:18,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:27:18,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:27:18,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:27:14" (1/3) ... [2024-11-13 16:27:18,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493e2b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:27:18, skipping insertion in model container [2024-11-13 16:27:18,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:15" (2/3) ... [2024-11-13 16:27:18,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493e2b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:27:18, skipping insertion in model container [2024-11-13 16:27:18,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:27:18" (3/3) ... [2024-11-13 16:27:18,063 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label57.c [2024-11-13 16:27:18,085 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:27:18,087 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label57.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 16:27:18,191 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:27:18,214 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;@2f7c0b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:27:18,214 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 16:27:18,223 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 16:27:18,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 16:27:18,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:27:18,237 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] [2024-11-13 16:27:18,238 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:27:18,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:18,244 INFO L85 PathProgramCache]: Analyzing trace with hash -792251374, now seen corresponding path program 1 times [2024-11-13 16:27:18,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:18,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491826686] [2024-11-13 16:27:18,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:18,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:18,972 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 16:27:18,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:18,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491826686] [2024-11-13 16:27:18,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491826686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:27:18,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:27:18,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:27:18,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978269855] [2024-11-13 16:27:18,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:27:18,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:27:18,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:19,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:27:19,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:27:19,025 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 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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 16:27:20,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:20,234 INFO L93 Difference]: Finished difference Result 601 states and 1035 transitions. [2024-11-13 16:27:20,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:27:20,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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 91 [2024-11-13 16:27:20,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:27:20,255 INFO L225 Difference]: With dead ends: 601 [2024-11-13 16:27:20,255 INFO L226 Difference]: Without dead ends: 310 [2024-11-13 16:27:20,260 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 16:27:20,263 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 143 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:27:20,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 117 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 16:27:20,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-13 16:27:20,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2024-11-13 16:27:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.4368932038834952) internal successors, (444), 309 states have internal predecessors, (444), 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 16:27:20,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 444 transitions. [2024-11-13 16:27:20,351 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 444 transitions. Word has length 91 [2024-11-13 16:27:20,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:27:20,352 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 444 transitions. [2024-11-13 16:27:20,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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 16:27:20,353 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 444 transitions. [2024-11-13 16:27:20,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 16:27:20,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:27:20,361 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] [2024-11-13 16:27:20,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 16:27:20,361 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:27:20,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:20,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1586849425, now seen corresponding path program 1 times [2024-11-13 16:27:20,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:20,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257981103] [2024-11-13 16:27:20,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:20,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:20,723 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 16:27:20,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:20,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257981103] [2024-11-13 16:27:20,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257981103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:27:20,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:27:20,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:27:20,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093565514] [2024-11-13 16:27:20,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:27:20,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:27:20,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:20,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:27:20,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:27:20,731 INFO L87 Difference]: Start difference. First operand 310 states and 444 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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 16:27:21,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:21,473 INFO L93 Difference]: Finished difference Result 911 states and 1313 transitions. [2024-11-13 16:27:21,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:27:21,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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 109 [2024-11-13 16:27:21,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:27:21,477 INFO L225 Difference]: With dead ends: 911 [2024-11-13 16:27:21,478 INFO L226 Difference]: Without dead ends: 603 [2024-11-13 16:27:21,479 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 16:27:21,480 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 156 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 16:27:21,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 98 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 16:27:21,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-11-13 16:27:21,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 598. [2024-11-13 16:27:21,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.3953098827470687) internal successors, (833), 597 states have internal predecessors, (833), 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 16:27:21,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 833 transitions. [2024-11-13 16:27:21,516 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 833 transitions. Word has length 109 [2024-11-13 16:27:21,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:27:21,516 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 833 transitions. [2024-11-13 16:27:21,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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 16:27:21,516 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 833 transitions. [2024-11-13 16:27:21,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 16:27:21,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:27:21,520 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-13 16:27:21,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 16:27:21,521 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:27:21,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:21,522 INFO L85 PathProgramCache]: Analyzing trace with hash 234700085, now seen corresponding path program 1 times [2024-11-13 16:27:21,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:21,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229634272] [2024-11-13 16:27:21,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:21,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:21,746 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:27:21,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:21,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229634272] [2024-11-13 16:27:21,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229634272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:27:21,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:27:21,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:27:21,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562832108] [2024-11-13 16:27:21,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:27:21,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:27:21,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:21,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:27:21,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:27:21,752 INFO L87 Difference]: Start difference. First operand 598 states and 833 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 16:27:22,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:22,435 INFO L93 Difference]: Finished difference Result 1194 states and 1666 transitions. [2024-11-13 16:27:22,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:27:22,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 119 [2024-11-13 16:27:22,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:27:22,441 INFO L225 Difference]: With dead ends: 1194 [2024-11-13 16:27:22,441 INFO L226 Difference]: Without dead ends: 598 [2024-11-13 16:27:22,454 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 16:27:22,455 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 144 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:27:22,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 287 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 16:27:22,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-11-13 16:27:22,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 593. [2024-11-13 16:27:22,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 592 states have (on average 1.3158783783783783) internal successors, (779), 592 states have internal predecessors, (779), 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 16:27:22,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 779 transitions. [2024-11-13 16:27:22,487 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 779 transitions. Word has length 119 [2024-11-13 16:27:22,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:27:22,487 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 779 transitions. [2024-11-13 16:27:22,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 16:27:22,488 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 779 transitions. [2024-11-13 16:27:22,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 16:27:22,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:27:22,491 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:27:22,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 16:27:22,492 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:27:22,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:22,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1912457173, now seen corresponding path program 1 times [2024-11-13 16:27:22,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:22,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700324419] [2024-11-13 16:27:22,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:22,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:22,729 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:27:22,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:22,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700324419] [2024-11-13 16:27:22,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700324419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:27:22,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:27:22,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:27:22,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701711588] [2024-11-13 16:27:22,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:27:22,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:27:22,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:22,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:27:22,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:27:22,735 INFO L87 Difference]: Start difference. First operand 593 states and 779 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 16:27:23,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:23,450 INFO L93 Difference]: Finished difference Result 1758 states and 2316 transitions. [2024-11-13 16:27:23,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:27:23,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 120 [2024-11-13 16:27:23,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:27:23,456 INFO L225 Difference]: With dead ends: 1758 [2024-11-13 16:27:23,456 INFO L226 Difference]: Without dead ends: 1167 [2024-11-13 16:27:23,458 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 16:27:23,459 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 174 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 16:27:23,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 118 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 16:27:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2024-11-13 16:27:23,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1166. [2024-11-13 16:27:23,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 1165 states have (on average 1.2746781115879828) internal successors, (1485), 1165 states have internal predecessors, (1485), 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 16:27:23,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1485 transitions. [2024-11-13 16:27:23,512 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1485 transitions. Word has length 120 [2024-11-13 16:27:23,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:27:23,514 INFO L471 AbstractCegarLoop]: Abstraction has 1166 states and 1485 transitions. [2024-11-13 16:27:23,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 16:27:23,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1485 transitions. [2024-11-13 16:27:23,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-13 16:27:23,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:27:23,524 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:27:23,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 16:27:23,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:27:23,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:23,528 INFO L85 PathProgramCache]: Analyzing trace with hash 756686793, now seen corresponding path program 1 times [2024-11-13 16:27:23,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:23,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618258999] [2024-11-13 16:27:23,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:23,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:23,718 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:27:23,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:23,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618258999] [2024-11-13 16:27:23,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618258999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:27:23,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:27:23,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:27:23,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390063264] [2024-11-13 16:27:23,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:27:23,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:27:23,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:23,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:27:23,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:27:23,721 INFO L87 Difference]: Start difference. First operand 1166 states and 1485 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 16:27:24,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:24,449 INFO L93 Difference]: Finished difference Result 2314 states and 2947 transitions. [2024-11-13 16:27:24,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:27:24,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 127 [2024-11-13 16:27:24,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:27:24,455 INFO L225 Difference]: With dead ends: 2314 [2024-11-13 16:27:24,455 INFO L226 Difference]: Without dead ends: 1150 [2024-11-13 16:27:24,457 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 16:27:24,457 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 126 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 16:27:24,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 251 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 16:27:24,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-11-13 16:27:24,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1010. [2024-11-13 16:27:24,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 1009 states have (on average 1.1674925668979188) internal successors, (1178), 1009 states have internal predecessors, (1178), 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 16:27:24,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1178 transitions. [2024-11-13 16:27:24,493 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1178 transitions. Word has length 127 [2024-11-13 16:27:24,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:27:24,494 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1178 transitions. [2024-11-13 16:27:24,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 16:27:24,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1178 transitions. [2024-11-13 16:27:24,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 16:27:24,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:27:24,499 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 16:27:24,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 16:27:24,500 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:27:24,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:24,500 INFO L85 PathProgramCache]: Analyzing trace with hash 2022223120, now seen corresponding path program 1 times [2024-11-13 16:27:24,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:24,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769387833] [2024-11-13 16:27:24,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:24,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 16:27:24,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:24,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769387833] [2024-11-13 16:27:24,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769387833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:27:24,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:27:24,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:27:24,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231427616] [2024-11-13 16:27:24,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:27:24,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:27:24,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:24,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:27:24,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:27:24,726 INFO L87 Difference]: Start difference. First operand 1010 states and 1178 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 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 16:27:25,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:25,103 INFO L93 Difference]: Finished difference Result 2008 states and 2344 transitions. [2024-11-13 16:27:25,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:27:25,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 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 16:27:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:27:25,109 INFO L225 Difference]: With dead ends: 2008 [2024-11-13 16:27:25,110 INFO L226 Difference]: Without dead ends: 717 [2024-11-13 16:27:25,112 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 16:27:25,113 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 191 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:27:25,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 21 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 16:27:25,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-11-13 16:27:25,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2024-11-13 16:27:25,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 716 states have (on average 1.143854748603352) internal successors, (819), 716 states have internal predecessors, (819), 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 16:27:25,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 819 transitions. [2024-11-13 16:27:25,141 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 819 transitions. Word has length 140 [2024-11-13 16:27:25,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:27:25,142 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 819 transitions. [2024-11-13 16:27:25,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 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 16:27:25,142 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 819 transitions. [2024-11-13 16:27:25,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-13 16:27:25,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:27:25,145 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] [2024-11-13 16:27:25,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 16:27:25,146 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:27:25,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:25,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1966333494, now seen corresponding path program 1 times [2024-11-13 16:27:25,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:25,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719873881] [2024-11-13 16:27:25,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:25,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:25,824 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 16:27:25,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:25,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719873881] [2024-11-13 16:27:25,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719873881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:27:25,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:27:25,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:27:25,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64899088] [2024-11-13 16:27:25,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:27:25,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:27:25,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:25,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:27:25,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:27:25,829 INFO L87 Difference]: Start difference. First operand 717 states and 819 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 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 16:27:26,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:26,600 INFO L93 Difference]: Finished difference Result 1573 states and 1798 transitions. [2024-11-13 16:27:26,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:27:26,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 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 159 [2024-11-13 16:27:26,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:27:26,605 INFO L225 Difference]: With dead ends: 1573 [2024-11-13 16:27:26,605 INFO L226 Difference]: Without dead ends: 858 [2024-11-13 16:27:26,606 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 16:27:26,607 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 100 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 16:27:26,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 93 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 16:27:26,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2024-11-13 16:27:26,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 857. [2024-11-13 16:27:26,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 856 states have (on average 1.1261682242990654) internal successors, (964), 856 states have internal predecessors, (964), 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 16:27:26,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 964 transitions. [2024-11-13 16:27:26,633 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 964 transitions. Word has length 159 [2024-11-13 16:27:26,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:27:26,635 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 964 transitions. [2024-11-13 16:27:26,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 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 16:27:26,636 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 964 transitions. [2024-11-13 16:27:26,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-13 16:27:26,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:27:26,643 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] [2024-11-13 16:27:26,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 16:27:26,643 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:27:26,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:26,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1364811136, now seen corresponding path program 1 times [2024-11-13 16:27:26,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:26,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004501818] [2024-11-13 16:27:26,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:26,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:27,116 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 16:27:27,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:27,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004501818] [2024-11-13 16:27:27,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004501818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:27:27,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:27:27,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:27:27,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015217313] [2024-11-13 16:27:27,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:27:27,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:27:27,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:27,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:27:27,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:27:27,119 INFO L87 Difference]: Start difference. First operand 857 states and 964 transitions. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 4 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 16:27:28,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:28,304 INFO L93 Difference]: Finished difference Result 1992 states and 2256 transitions. [2024-11-13 16:27:28,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:27:28,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 4 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 164 [2024-11-13 16:27:28,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:27:28,309 INFO L225 Difference]: With dead ends: 1992 [2024-11-13 16:27:28,309 INFO L226 Difference]: Without dead ends: 997 [2024-11-13 16:27:28,311 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 16:27:28,312 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 16:27:28,312 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 16:27:28,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2024-11-13 16:27:28,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 857. [2024-11-13 16:27:28,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 856 states have (on average 1.0794392523364487) internal successors, (924), 856 states have internal predecessors, (924), 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 16:27:28,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 924 transitions. [2024-11-13 16:27:28,353 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 924 transitions. Word has length 164 [2024-11-13 16:27:28,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:27:28,354 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 924 transitions. [2024-11-13 16:27:28,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 4 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 16:27:28,354 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 924 transitions. [2024-11-13 16:27:28,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 16:27:28,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:27:28,358 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-13 16:27:28,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 16:27:28,359 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:27:28,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:28,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1726690038, now seen corresponding path program 1 times [2024-11-13 16:27:28,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:28,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226732079] [2024-11-13 16:27:28,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:28,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:27:28,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:28,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226732079] [2024-11-13 16:27:28,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226732079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:27:28,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:27:28,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:27:28,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479203396] [2024-11-13 16:27:28,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:27:28,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:27:28,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:28,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:27:28,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:27:28,693 INFO L87 Difference]: Start difference. First operand 857 states and 924 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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 16:27:29,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:29,267 INFO L93 Difference]: Finished difference Result 1852 states and 2002 transitions. [2024-11-13 16:27:29,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:27:29,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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 168 [2024-11-13 16:27:29,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:27:29,273 INFO L225 Difference]: With dead ends: 1852 [2024-11-13 16:27:29,273 INFO L226 Difference]: Without dead ends: 997 [2024-11-13 16:27:29,274 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 16:27:29,275 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 77 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:27:29,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 203 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 16:27:29,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2024-11-13 16:27:29,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2024-11-13 16:27:29,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 996 states have (on average 1.0602409638554218) internal successors, (1056), 996 states have internal predecessors, (1056), 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 16:27:29,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1056 transitions. [2024-11-13 16:27:29,309 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1056 transitions. Word has length 168 [2024-11-13 16:27:29,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:27:29,309 INFO L471 AbstractCegarLoop]: Abstraction has 997 states and 1056 transitions. [2024-11-13 16:27:29,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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 16:27:29,310 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1056 transitions. [2024-11-13 16:27:29,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-13 16:27:29,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:27:29,314 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] [2024-11-13 16:27:29,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 16:27:29,314 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:27:29,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:29,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1401823527, now seen corresponding path program 1 times [2024-11-13 16:27:29,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:29,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373830617] [2024-11-13 16:27:29,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:29,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:29,913 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 16:27:29,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:29,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373830617] [2024-11-13 16:27:29,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373830617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:27:29,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:27:29,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:27:29,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128528077] [2024-11-13 16:27:29,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:27:29,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:27:29,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:29,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:27:29,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:27:29,916 INFO L87 Difference]: Start difference. First operand 997 states and 1056 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 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 16:27:30,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:30,478 INFO L93 Difference]: Finished difference Result 1223 states and 1282 transitions. [2024-11-13 16:27:30,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:27:30,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 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 16:27:30,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:27:30,485 INFO L225 Difference]: With dead ends: 1223 [2024-11-13 16:27:30,485 INFO L226 Difference]: Without dead ends: 997 [2024-11-13 16:27:30,486 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 16:27:30,486 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 16:27:30,487 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 16:27:30,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2024-11-13 16:27:30,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2024-11-13 16:27:30,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 996 states have (on average 1.0562248995983936) internal successors, (1052), 996 states have internal predecessors, (1052), 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 16:27:30,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1052 transitions. [2024-11-13 16:27:30,516 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1052 transitions. Word has length 189 [2024-11-13 16:27:30,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:27:30,516 INFO L471 AbstractCegarLoop]: Abstraction has 997 states and 1052 transitions. [2024-11-13 16:27:30,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 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 16:27:30,517 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1052 transitions. [2024-11-13 16:27:30,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-13 16:27:30,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:27:30,521 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, 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] [2024-11-13 16:27:30,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 16:27:30,522 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:27:30,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:30,522 INFO L85 PathProgramCache]: Analyzing trace with hash 479114743, now seen corresponding path program 1 times [2024-11-13 16:27:30,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:30,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439277276] [2024-11-13 16:27:30,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:30,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:30,719 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-13 16:27:30,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:30,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439277276] [2024-11-13 16:27:30,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439277276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:27:30,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:27:30,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:27:30,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690501466] [2024-11-13 16:27:30,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:27:30,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:27:30,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:30,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:27:30,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:27:30,722 INFO L87 Difference]: Start difference. First operand 997 states and 1052 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 16:27:31,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:31,250 INFO L93 Difference]: Finished difference Result 2274 states and 2418 transitions. [2024-11-13 16:27:31,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:27:31,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 196 [2024-11-13 16:27:31,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:27:31,256 INFO L225 Difference]: With dead ends: 2274 [2024-11-13 16:27:31,256 INFO L226 Difference]: Without dead ends: 1275 [2024-11-13 16:27:31,258 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 16:27:31,260 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 127 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:27:31,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 179 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 16:27:31,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2024-11-13 16:27:31,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1275. [2024-11-13 16:27:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 1274 states have (on average 1.0525902668759812) internal successors, (1341), 1274 states have internal predecessors, (1341), 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 16:27:31,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1341 transitions. [2024-11-13 16:27:31,290 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1341 transitions. Word has length 196 [2024-11-13 16:27:31,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:27:31,291 INFO L471 AbstractCegarLoop]: Abstraction has 1275 states and 1341 transitions. [2024-11-13 16:27:31,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 16:27:31,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1341 transitions. [2024-11-13 16:27:31,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-13 16:27:31,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:27:31,295 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] [2024-11-13 16:27:31,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 16:27:31,295 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:27:31,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:31,296 INFO L85 PathProgramCache]: Analyzing trace with hash -2046229662, now seen corresponding path program 1 times [2024-11-13 16:27:31,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:31,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408636807] [2024-11-13 16:27:31,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:31,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:31,562 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 16:27:31,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:31,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408636807] [2024-11-13 16:27:31,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408636807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:27:31,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:27:31,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:27:31,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069096536] [2024-11-13 16:27:31,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:27:31,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:27:31,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:31,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:27:31,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:27:31,566 INFO L87 Difference]: Start difference. First operand 1275 states and 1341 transitions. Second operand has 3 states, 3 states have (on average 64.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 16:27:32,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:32,101 INFO L93 Difference]: Finished difference Result 2689 states and 2841 transitions. [2024-11-13 16:27:32,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:27:32,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.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 237 [2024-11-13 16:27:32,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:27:32,107 INFO L225 Difference]: With dead ends: 2689 [2024-11-13 16:27:32,107 INFO L226 Difference]: Without dead ends: 1274 [2024-11-13 16:27:32,109 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 16:27:32,109 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 119 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:27:32,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 50 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 16:27:32,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2024-11-13 16:27:32,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1274. [2024-11-13 16:27:32,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1273 states have (on average 1.0369206598586018) internal successors, (1320), 1273 states have internal predecessors, (1320), 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 16:27:32,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1320 transitions. [2024-11-13 16:27:32,147 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1320 transitions. Word has length 237 [2024-11-13 16:27:32,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:27:32,148 INFO L471 AbstractCegarLoop]: Abstraction has 1274 states and 1320 transitions. [2024-11-13 16:27:32,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.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 16:27:32,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1320 transitions. [2024-11-13 16:27:32,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-13 16:27:32,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:27:32,153 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, 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] [2024-11-13 16:27:32,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 16:27:32,154 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:27:32,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:32,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1969642663, now seen corresponding path program 1 times [2024-11-13 16:27:32,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:32,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811406936] [2024-11-13 16:27:32,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:32,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-13 16:27:32,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:32,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811406936] [2024-11-13 16:27:32,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811406936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:27:32,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:27:32,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:27:32,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310481366] [2024-11-13 16:27:32,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:27:32,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:27:32,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:32,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:27:32,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:27:32,522 INFO L87 Difference]: Start difference. First operand 1274 states and 1320 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 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 16:27:33,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:33,040 INFO L93 Difference]: Finished difference Result 2405 states and 2495 transitions. [2024-11-13 16:27:33,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:27:33,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 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 254 [2024-11-13 16:27:33,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:27:33,046 INFO L225 Difference]: With dead ends: 2405 [2024-11-13 16:27:33,047 INFO L226 Difference]: Without dead ends: 1273 [2024-11-13 16:27:33,048 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 16:27:33,049 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 121 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:27:33,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 36 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 16:27:33,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2024-11-13 16:27:33,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1272. [2024-11-13 16:27:33,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1271 states have (on average 1.028324154209284) internal successors, (1307), 1271 states have internal predecessors, (1307), 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 16:27:33,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1307 transitions. [2024-11-13 16:27:33,088 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1307 transitions. Word has length 254 [2024-11-13 16:27:33,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:27:33,089 INFO L471 AbstractCegarLoop]: Abstraction has 1272 states and 1307 transitions. [2024-11-13 16:27:33,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 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 16:27:33,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1307 transitions. [2024-11-13 16:27:33,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-13 16:27:33,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:27:33,095 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2024-11-13 16:27:33,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 16:27:33,096 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:27:33,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:33,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1190860327, now seen corresponding path program 1 times [2024-11-13 16:27:33,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:33,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369614547] [2024-11-13 16:27:33,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:33,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:33,629 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 16:27:33,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:33,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369614547] [2024-11-13 16:27:33,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369614547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:27:33,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:27:33,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:27:33,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082410146] [2024-11-13 16:27:33,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:27:33,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:27:33,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:33,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:27:33,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:27:33,634 INFO L87 Difference]: Start difference. First operand 1272 states and 1307 transitions. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 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 16:27:34,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:34,217 INFO L93 Difference]: Finished difference Result 1976 states and 2032 transitions. [2024-11-13 16:27:34,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:27:34,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 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 16:27:34,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:27:34,219 INFO L225 Difference]: With dead ends: 1976 [2024-11-13 16:27:34,219 INFO L226 Difference]: Without dead ends: 0 [2024-11-13 16:27:34,221 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 16:27:34,221 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 83 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:27:34,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 180 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 16:27:34,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-13 16:27:34,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-13 16:27:34,223 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 16:27:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-13 16:27:34,224 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 268 [2024-11-13 16:27:34,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:27:34,224 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 16:27:34,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 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 16:27:34,224 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-13 16:27:34,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 16:27:34,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 16:27:34,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 16:27:34,233 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:27:34,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-13 16:27:34,603 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 16:27:34,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 04:27:34 BoogieIcfgContainer [2024-11-13 16:27:34,640 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 16:27:34,641 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 16:27:34,641 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 16:27:34,641 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 16:27:34,642 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:27:18" (3/4) ... [2024-11-13 16:27:34,645 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 16:27:34,669 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-13 16:27:34,674 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-13 16:27:34,674 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 16:27:34,675 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 16:27:34,862 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edaf5c01-3884-487c-8eaa-14e9e3fa406c/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 16:27:34,862 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edaf5c01-3884-487c-8eaa-14e9e3fa406c/bin/uautomizer-verify-qhAvR1uOyd/witness.yml [2024-11-13 16:27:34,862 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 16:27:34,864 INFO L158 Benchmark]: Toolchain (without parser) took 19883.87ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 91.7MB in the beginning and 109.5MB in the end (delta: -17.8MB). Peak memory consumption was 83.6MB. Max. memory is 16.1GB. [2024-11-13 16:27:34,865 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 117.4MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:27:34,866 INFO L158 Benchmark]: CACSL2BoogieTranslator took 780.47ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 66.0MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 16:27:34,866 INFO L158 Benchmark]: Boogie Procedure Inliner took 131.86ms. Allocated memory is still 117.4MB. Free memory was 65.8MB in the beginning and 60.8MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:27:34,867 INFO L158 Benchmark]: Boogie Preprocessor took 127.65ms. Allocated memory is still 117.4MB. Free memory was 60.8MB in the beginning and 56.0MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:27:34,867 INFO L158 Benchmark]: RCFGBuilder took 2025.99ms. Allocated memory is still 117.4MB. Free memory was 56.0MB in the beginning and 85.5MB in the end (delta: -29.5MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2024-11-13 16:27:34,868 INFO L158 Benchmark]: TraceAbstraction took 16586.75ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 84.8MB in the beginning and 120.2MB in the end (delta: -35.4MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. [2024-11-13 16:27:34,869 INFO L158 Benchmark]: Witness Printer took 222.02ms. Allocated memory is still 218.1MB. Free memory was 120.2MB in the beginning and 109.5MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:27:34,872 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.45ms. Allocated memory is still 117.4MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 780.47ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 66.0MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 131.86ms. Allocated memory is still 117.4MB. Free memory was 65.8MB in the beginning and 60.8MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 127.65ms. Allocated memory is still 117.4MB. Free memory was 60.8MB in the beginning and 56.0MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2025.99ms. Allocated memory is still 117.4MB. Free memory was 56.0MB in the beginning and 85.5MB in the end (delta: -29.5MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. * TraceAbstraction took 16586.75ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 84.8MB in the beginning and 120.2MB in the end (delta: -35.4MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. * Witness Printer took 222.02ms. Allocated memory is still 218.1MB. Free memory was 120.2MB in the beginning and 109.5MB in the end (delta: 10.7MB). 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: 455]: 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: 16.1s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1960 SdHoareTripleChecker+Valid, 9.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1960 mSDsluCounter, 1752 SdHoareTripleChecker+Invalid, 7.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 249 mSDsCounter, 580 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5576 IncrementalHoareTripleChecker+Invalid, 6156 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 580 mSolverCounterUnsat, 1503 mSDtfsCounter, 5576 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1275occurred in iteration=11, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 293 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 2341 NumberOfCodeBlocks, 2341 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2327 ConstructedInterpolants, 0 QuantifiedInterpolants, 6914 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 1674/1674 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: ((((((((((((a28 <= 8) && (a21 == 1)) && (a17 <= 8)) && (a11 <= 0)) && (a25 <= 0)) || ((((((a19 == 0) && (a25 == 1)) && (a11 == 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) || (((((11 <= a28) && (a25 == 1)) && (a17 <= 8)) && (a11 <= 0)) && (a19 == 1))) || ((((((9 <= a28) && (a25 == 1)) && (a21 == 1)) && (a17 <= 8)) && (a11 <= 0)) && (a28 <= 10))) || (((((a25 == 1) && (a21 == 1)) && (a17 <= 8)) && (a11 <= 0)) && (a19 == 1))) || (((((a17 == 8) && (a21 == 1)) && (a11 <= 0)) && (a19 == 1)) && (a25 <= 0))) || ((((a25 == 1) && (a11 == 1)) && (a17 <= 8)) && (a19 == 1))) || (((a11 == 1) && (a17 <= 8)) && (a25 <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-13 16:27:34,918 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edaf5c01-3884-487c-8eaa-14e9e3fa406c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE