./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/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_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/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 64bit --witnessprinter.graph.data.programhash e188a971cba665e2b77b0e826b47d617ddf57bd12a8f8136f6d81bf903c7591b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:57:01,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:57:01,521 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-13 15:57:01,537 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:57:01,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:57:01,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:57:01,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:57:01,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:57:01,590 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:57:01,591 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:57:01,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:57:01,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:57:01,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:57:01,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:57:01,593 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:57:01,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:57:01,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:57:01,595 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:57:01,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:57:01,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:57:01,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:57:01,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:57:01,596 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:57:01,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:57:01,596 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:57:01,596 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:57:01,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:57:01,596 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:57:01,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:57:01,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:57:01,597 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:57:01,598 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:57:01,598 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:57:01,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:57:01,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:57:01,598 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:57:01,598 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:57:01,599 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:57:01,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:57:01,600 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_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e188a971cba665e2b77b0e826b47d617ddf57bd12a8f8136f6d81bf903c7591b [2024-11-13 15:57:02,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:57:02,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:57:02,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:57:02,030 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:57:02,031 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:57:02,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c Unable to find full path for "g++" [2024-11-13 15:57:04,354 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:57:04,754 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:57:04,755 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c [2024-11-13 15:57:04,771 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/data/2cae02bec/df601d8ed5ae4637a775cbe6ae9f1e0a/FLAG688d38141 [2024-11-13 15:57:04,948 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/data/2cae02bec/df601d8ed5ae4637a775cbe6ae9f1e0a [2024-11-13 15:57:04,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:57:04,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:57:04,955 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:57:04,955 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:57:04,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:57:04,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:57:04" (1/1) ... [2024-11-13 15:57:04,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b4c3b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:57:04, skipping insertion in model container [2024-11-13 15:57:04,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:57:04" (1/1) ... [2024-11-13 15:57:04,990 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:57:05,180 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_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c[1245,1258] [2024-11-13 15:57:05,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:57:05,328 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:57:05,341 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_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c[1245,1258] [2024-11-13 15:57:05,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:57:05,447 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:57:05,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:57:05 WrapperNode [2024-11-13 15:57:05,448 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:57:05,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:57:05,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:57:05,449 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:57:05,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:57:05" (1/1) ... [2024-11-13 15:57:05,483 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:57:05" (1/1) ... [2024-11-13 15:57:05,568 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 506 [2024-11-13 15:57:05,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:57:05,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:57:05,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:57:05,570 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:57:05,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:57:05" (1/1) ... [2024-11-13 15:57:05,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:57:05" (1/1) ... [2024-11-13 15:57:05,595 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:57:05" (1/1) ... [2024-11-13 15:57:05,629 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-13 15:57:05,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:57:05" (1/1) ... [2024-11-13 15:57:05,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:57:05" (1/1) ... [2024-11-13 15:57:05,655 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:57:05" (1/1) ... [2024-11-13 15:57:05,662 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:57:05" (1/1) ... [2024-11-13 15:57:05,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:57:05" (1/1) ... [2024-11-13 15:57:05,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:57:05" (1/1) ... [2024-11-13 15:57:05,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:57:05,687 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:57:05,687 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:57:05,687 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:57:05,688 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:57:05" (1/1) ... [2024-11-13 15:57:05,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:57:05,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:57:05,736 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:57:05,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:57:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:57:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:57:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 15:57:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:57:05,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:57:05,997 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:57:06,000 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:57:07,277 INFO L? ?]: Removed 307 outVars from TransFormulas that were not future-live. [2024-11-13 15:57:07,277 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:57:07,298 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:57:07,298 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:57:07,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:57:07 BoogieIcfgContainer [2024-11-13 15:57:07,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:57:07,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:57:07,303 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:57:07,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:57:07,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:57:04" (1/3) ... [2024-11-13 15:57:07,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f992326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:57:07, skipping insertion in model container [2024-11-13 15:57:07,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:57:05" (2/3) ... [2024-11-13 15:57:07,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f992326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:57:07, skipping insertion in model container [2024-11-13 15:57:07,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:57:07" (3/3) ... [2024-11-13 15:57:07,314 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b02.c [2024-11-13 15:57:07,335 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:57:07,337 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_b02.c that has 1 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:57:07,425 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:57:07,443 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;@59433dee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:57:07,443 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:57:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 117 states have internal predecessors, (173), 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 15:57:07,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 15:57:07,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:57:07,457 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:57:07,458 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:57:07,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:57:07,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1610079203, now seen corresponding path program 1 times [2024-11-13 15:57:07,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:57:07,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090023672] [2024-11-13 15:57:07,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:57:07,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:57:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:57:08,460 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 15:57:08,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:57:08,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090023672] [2024-11-13 15:57:08,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090023672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:57:08,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:57:08,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:57:08,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084222244] [2024-11-13 15:57:08,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:57:08,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:57:08,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:57:08,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:57:08,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:57:08,509 INFO L87 Difference]: Start difference. First operand has 118 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 117 states have internal predecessors, (173), 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 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 15:57:08,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:57:08,584 INFO L93 Difference]: Finished difference Result 225 states and 333 transitions. [2024-11-13 15:57:08,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:57:08,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2024-11-13 15:57:08,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:57:08,601 INFO L225 Difference]: With dead ends: 225 [2024-11-13 15:57:08,602 INFO L226 Difference]: Without dead ends: 117 [2024-11-13 15:57:08,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:57:08,613 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:57:08,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 495 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:57:08,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-13 15:57:08,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-13 15:57:08,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.4741379310344827) internal successors, (171), 116 states have internal predecessors, (171), 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 15:57:08,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2024-11-13 15:57:08,682 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 19 [2024-11-13 15:57:08,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:57:08,682 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2024-11-13 15:57:08,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 15:57:08,683 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2024-11-13 15:57:08,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 15:57:08,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:57:08,686 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] [2024-11-13 15:57:08,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:57:08,687 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:57:08,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:57:08,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1628847503, now seen corresponding path program 1 times [2024-11-13 15:57:08,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:57:08,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099081054] [2024-11-13 15:57:08,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:57:08,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:57:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:57:09,021 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 15:57:09,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:57:09,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099081054] [2024-11-13 15:57:09,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099081054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:57:09,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:57:09,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:57:09,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564376754] [2024-11-13 15:57:09,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:57:09,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:57:09,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:57:09,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:57:09,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:57:09,027 INFO L87 Difference]: Start difference. First operand 117 states and 171 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 15:57:09,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:57:09,121 INFO L93 Difference]: Finished difference Result 226 states and 331 transitions. [2024-11-13 15:57:09,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:57:09,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2024-11-13 15:57:09,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:57:09,125 INFO L225 Difference]: With dead ends: 226 [2024-11-13 15:57:09,125 INFO L226 Difference]: Without dead ends: 119 [2024-11-13 15:57:09,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:57:09,127 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:57:09,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:57:09,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-13 15:57:09,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-13 15:57:09,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4661016949152543) internal successors, (173), 118 states have internal predecessors, (173), 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 15:57:09,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 173 transitions. [2024-11-13 15:57:09,154 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 173 transitions. Word has length 20 [2024-11-13 15:57:09,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:57:09,155 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 173 transitions. [2024-11-13 15:57:09,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 15:57:09,155 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 173 transitions. [2024-11-13 15:57:09,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 15:57:09,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:57:09,158 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] [2024-11-13 15:57:09,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:57:09,159 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:57:09,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:57:09,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2143300810, now seen corresponding path program 1 times [2024-11-13 15:57:09,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:57:09,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632988012] [2024-11-13 15:57:09,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:57:09,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:57:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:57:09,818 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 15:57:09,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:57:09,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632988012] [2024-11-13 15:57:09,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632988012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:57:09,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:57:09,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:57:09,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141888396] [2024-11-13 15:57:09,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:57:09,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:57:09,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:57:09,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:57:09,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:57:09,823 INFO L87 Difference]: Start difference. First operand 119 states and 173 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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 15:57:09,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:57:09,970 INFO L93 Difference]: Finished difference Result 232 states and 338 transitions. [2024-11-13 15:57:09,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:57:09,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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 21 [2024-11-13 15:57:09,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:57:09,972 INFO L225 Difference]: With dead ends: 232 [2024-11-13 15:57:09,972 INFO L226 Difference]: Without dead ends: 123 [2024-11-13 15:57:09,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:57:09,975 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 162 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:57:09,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 628 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:57:09,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-13 15:57:09,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-11-13 15:57:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.4545454545454546) internal successors, (176), 121 states have internal predecessors, (176), 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 15:57:09,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 176 transitions. [2024-11-13 15:57:09,986 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 176 transitions. Word has length 21 [2024-11-13 15:57:09,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:57:09,987 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 176 transitions. [2024-11-13 15:57:09,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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 15:57:09,987 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 176 transitions. [2024-11-13 15:57:09,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 15:57:09,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:57:09,991 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] [2024-11-13 15:57:09,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:57:09,991 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:57:09,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:57:09,992 INFO L85 PathProgramCache]: Analyzing trace with hash -453270478, now seen corresponding path program 1 times [2024-11-13 15:57:09,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:57:09,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800567503] [2024-11-13 15:57:09,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:57:09,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:57:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:57:10,575 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 15:57:10,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:57:10,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800567503] [2024-11-13 15:57:10,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800567503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:57:10,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:57:10,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:57:10,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12001164] [2024-11-13 15:57:10,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:57:10,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:57:10,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:57:10,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:57:10,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:57:10,579 INFO L87 Difference]: Start difference. First operand 122 states and 176 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 15:57:10,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:57:10,653 INFO L93 Difference]: Finished difference Result 231 states and 335 transitions. [2024-11-13 15:57:10,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:57:10,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2024-11-13 15:57:10,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:57:10,655 INFO L225 Difference]: With dead ends: 231 [2024-11-13 15:57:10,655 INFO L226 Difference]: Without dead ends: 119 [2024-11-13 15:57:10,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:57:10,660 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 6 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:57:10,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 479 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:57:10,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-13 15:57:10,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-13 15:57:10,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4576271186440677) internal successors, (172), 118 states have internal predecessors, (172), 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 15:57:10,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2024-11-13 15:57:10,677 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 22 [2024-11-13 15:57:10,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:57:10,677 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2024-11-13 15:57:10,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 15:57:10,680 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2024-11-13 15:57:10,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 15:57:10,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:57:10,681 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] [2024-11-13 15:57:10,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:57:10,681 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:57:10,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:57:10,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1108928778, now seen corresponding path program 1 times [2024-11-13 15:57:10,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:57:10,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923282411] [2024-11-13 15:57:10,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:57:10,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:57:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:57:11,302 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 15:57:11,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:57:11,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923282411] [2024-11-13 15:57:11,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923282411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:57:11,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:57:11,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:57:11,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490126677] [2024-11-13 15:57:11,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:57:11,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:57:11,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:57:11,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:57:11,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:57:11,306 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 15:57:11,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:57:11,490 INFO L93 Difference]: Finished difference Result 238 states and 344 transitions. [2024-11-13 15:57:11,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:57:11,491 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 22 [2024-11-13 15:57:11,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:57:11,492 INFO L225 Difference]: With dead ends: 238 [2024-11-13 15:57:11,493 INFO L226 Difference]: Without dead ends: 129 [2024-11-13 15:57:11,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:57:11,497 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 178 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:57:11,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 952 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:57:11,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-13 15:57:11,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2024-11-13 15:57:11,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.4488188976377954) internal successors, (184), 127 states have internal predecessors, (184), 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 15:57:11,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 184 transitions. [2024-11-13 15:57:11,513 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 184 transitions. Word has length 22 [2024-11-13 15:57:11,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:57:11,513 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 184 transitions. [2024-11-13 15:57:11,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 15:57:11,514 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 184 transitions. [2024-11-13 15:57:11,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 15:57:11,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:57:11,516 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] [2024-11-13 15:57:11,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 15:57:11,517 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:57:11,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:57:11,517 INFO L85 PathProgramCache]: Analyzing trace with hash 302292627, now seen corresponding path program 1 times [2024-11-13 15:57:11,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:57:11,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572693140] [2024-11-13 15:57:11,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:57:11,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:57:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:57:11,955 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 15:57:11,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:57:11,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572693140] [2024-11-13 15:57:11,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572693140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:57:11,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:57:11,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:57:11,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452349508] [2024-11-13 15:57:11,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:57:11,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:57:11,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:57:11,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:57:11,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:57:11,958 INFO L87 Difference]: Start difference. First operand 128 states and 184 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 15:57:12,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:57:12,020 INFO L93 Difference]: Finished difference Result 252 states and 362 transitions. [2024-11-13 15:57:12,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:57:12,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2024-11-13 15:57:12,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:57:12,022 INFO L225 Difference]: With dead ends: 252 [2024-11-13 15:57:12,022 INFO L226 Difference]: Without dead ends: 134 [2024-11-13 15:57:12,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:57:12,023 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 161 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:57:12,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 485 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:57:12,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-13 15:57:12,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-13 15:57:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.4285714285714286) internal successors, (190), 133 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:57:12,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 190 transitions. [2024-11-13 15:57:12,042 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 190 transitions. Word has length 23 [2024-11-13 15:57:12,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:57:12,043 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 190 transitions. [2024-11-13 15:57:12,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 15:57:12,043 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 190 transitions. [2024-11-13 15:57:12,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 15:57:12,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:57:12,044 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] [2024-11-13 15:57:12,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 15:57:12,044 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:57:12,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:57:12,044 INFO L85 PathProgramCache]: Analyzing trace with hash 828087592, now seen corresponding path program 1 times [2024-11-13 15:57:12,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:57:12,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846555598] [2024-11-13 15:57:12,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:57:12,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:57:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:57:12,267 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 15:57:12,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:57:12,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846555598] [2024-11-13 15:57:12,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846555598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:57:12,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:57:12,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:57:12,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789778976] [2024-11-13 15:57:12,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:57:12,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:57:12,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:57:12,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:57:12,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:57:12,270 INFO L87 Difference]: Start difference. First operand 134 states and 190 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 15:57:12,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:57:12,520 INFO L93 Difference]: Finished difference Result 322 states and 454 transitions. [2024-11-13 15:57:12,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:57:12,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 23 [2024-11-13 15:57:12,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:57:12,523 INFO L225 Difference]: With dead ends: 322 [2024-11-13 15:57:12,523 INFO L226 Difference]: Without dead ends: 198 [2024-11-13 15:57:12,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:57:12,525 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 318 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:57:12,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 595 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:57:12,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-13 15:57:12,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 136. [2024-11-13 15:57:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.4222222222222223) internal successors, (192), 135 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 15:57:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 192 transitions. [2024-11-13 15:57:12,542 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 192 transitions. Word has length 23 [2024-11-13 15:57:12,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:57:12,542 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 192 transitions. [2024-11-13 15:57:12,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 15:57:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 192 transitions. [2024-11-13 15:57:12,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 15:57:12,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:57:12,543 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] [2024-11-13 15:57:12,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 15:57:12,544 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:57:12,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:57:12,544 INFO L85 PathProgramCache]: Analyzing trace with hash -29066406, now seen corresponding path program 1 times [2024-11-13 15:57:12,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:57:12,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470407908] [2024-11-13 15:57:12,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:57:12,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:57:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:57:12,742 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 15:57:12,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:57:12,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470407908] [2024-11-13 15:57:12,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470407908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:57:12,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:57:12,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:57:12,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092223158] [2024-11-13 15:57:12,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:57:12,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:57:12,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:57:12,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:57:12,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:57:12,746 INFO L87 Difference]: Start difference. First operand 136 states and 192 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 15:57:12,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:57:12,904 INFO L93 Difference]: Finished difference Result 348 states and 495 transitions. [2024-11-13 15:57:12,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:57:12,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 24 [2024-11-13 15:57:12,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:57:12,906 INFO L225 Difference]: With dead ends: 348 [2024-11-13 15:57:12,909 INFO L226 Difference]: Without dead ends: 224 [2024-11-13 15:57:12,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:57:12,910 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 416 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:57:12,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 459 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:57:12,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-13 15:57:12,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 138. [2024-11-13 15:57:12,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.416058394160584) internal successors, (194), 137 states have internal predecessors, (194), 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 15:57:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 194 transitions. [2024-11-13 15:57:12,928 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 194 transitions. Word has length 24 [2024-11-13 15:57:12,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:57:12,929 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 194 transitions. [2024-11-13 15:57:12,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 15:57:12,929 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 194 transitions. [2024-11-13 15:57:12,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 15:57:12,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:57:12,931 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:57:12,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 15:57:12,935 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:57:12,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:57:12,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1543636838, now seen corresponding path program 1 times [2024-11-13 15:57:12,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:57:12,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141485538] [2024-11-13 15:57:12,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:57:12,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:57:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:57:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:57:17,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:57:17,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141485538] [2024-11-13 15:57:17,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141485538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:57:17,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284166159] [2024-11-13 15:57:17,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:57:17,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:57:17,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:57:17,162 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:57:17,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:57:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:57:17,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-13 15:57:17,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:57:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:57:19,814 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:57:19,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284166159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:57:19,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:57:19,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2024-11-13 15:57:19,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441286445] [2024-11-13 15:57:19,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:57:19,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:57:19,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:57:19,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:57:19,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-13 15:57:19,817 INFO L87 Difference]: Start difference. First operand 138 states and 194 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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 15:57:20,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:57:20,770 INFO L93 Difference]: Finished difference Result 381 states and 543 transitions. [2024-11-13 15:57:20,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:57:20,771 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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 77 [2024-11-13 15:57:20,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:57:20,774 INFO L225 Difference]: With dead ends: 381 [2024-11-13 15:57:20,774 INFO L226 Difference]: Without dead ends: 257 [2024-11-13 15:57:20,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-11-13 15:57:20,776 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 438 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 15:57:20,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 517 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 15:57:20,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-13 15:57:20,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 222. [2024-11-13 15:57:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.420814479638009) internal successors, (314), 221 states have internal predecessors, (314), 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 15:57:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 314 transitions. [2024-11-13 15:57:20,793 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 314 transitions. Word has length 77 [2024-11-13 15:57:20,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:57:20,794 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 314 transitions. [2024-11-13 15:57:20,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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 15:57:20,794 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 314 transitions. [2024-11-13 15:57:20,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 15:57:20,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:57:20,801 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:57:20,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 15:57:21,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:57:21,002 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:57:21,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:57:21,003 INFO L85 PathProgramCache]: Analyzing trace with hash 294751161, now seen corresponding path program 1 times [2024-11-13 15:57:21,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:57:21,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168469072] [2024-11-13 15:57:21,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:57:21,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:57:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:57:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:57:22,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:57:22,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168469072] [2024-11-13 15:57:22,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168469072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:57:22,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:57:22,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:57:22,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175198864] [2024-11-13 15:57:22,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:57:22,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:57:22,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:57:22,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:57:22,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:57:22,725 INFO L87 Difference]: Start difference. First operand 222 states and 314 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 15:57:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:57:23,295 INFO L93 Difference]: Finished difference Result 375 states and 533 transitions. [2024-11-13 15:57:23,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:57:23,296 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 78 [2024-11-13 15:57:23,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:57:23,298 INFO L225 Difference]: With dead ends: 375 [2024-11-13 15:57:23,301 INFO L226 Difference]: Without dead ends: 251 [2024-11-13 15:57:23,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:57:23,303 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 389 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:57:23,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 596 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:57:23,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-13 15:57:23,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2024-11-13 15:57:23,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.4230769230769231) internal successors, (333), 234 states have internal predecessors, (333), 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 15:57:23,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 333 transitions. [2024-11-13 15:57:23,319 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 333 transitions. Word has length 78 [2024-11-13 15:57:23,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:57:23,319 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 333 transitions. [2024-11-13 15:57:23,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 15:57:23,320 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 333 transitions. [2024-11-13 15:57:23,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 15:57:23,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:57:23,322 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:57:23,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 15:57:23,323 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:57:23,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:57:23,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1819497476, now seen corresponding path program 1 times [2024-11-13 15:57:23,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:57:23,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730188271] [2024-11-13 15:57:23,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:57:23,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:57:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:57:24,347 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:57:24,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:57:24,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730188271] [2024-11-13 15:57:24,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730188271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:57:24,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:57:24,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:57:24,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414024231] [2024-11-13 15:57:24,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:57:24,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:57:24,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:57:24,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:57:24,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:57:24,351 INFO L87 Difference]: Start difference. First operand 235 states and 333 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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 15:57:24,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:57:24,543 INFO L93 Difference]: Finished difference Result 406 states and 578 transitions. [2024-11-13 15:57:24,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:57:24,544 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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 78 [2024-11-13 15:57:24,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:57:24,546 INFO L225 Difference]: With dead ends: 406 [2024-11-13 15:57:24,546 INFO L226 Difference]: Without dead ends: 245 [2024-11-13 15:57:24,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:57:24,547 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 128 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:57:24,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 679 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:57:24,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-13 15:57:24,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2024-11-13 15:57:24,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.4139344262295082) internal successors, (345), 244 states have internal predecessors, (345), 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 15:57:24,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 345 transitions. [2024-11-13 15:57:24,564 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 345 transitions. Word has length 78 [2024-11-13 15:57:24,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:57:24,565 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 345 transitions. [2024-11-13 15:57:24,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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 15:57:24,566 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 345 transitions. [2024-11-13 15:57:24,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-13 15:57:24,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:57:24,567 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:57:24,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 15:57:24,568 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:57:24,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:57:24,568 INFO L85 PathProgramCache]: Analyzing trace with hash -486456451, now seen corresponding path program 1 times [2024-11-13 15:57:24,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:57:24,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827272219] [2024-11-13 15:57:24,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:57:24,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:57:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:57:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:57:26,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:57:26,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827272219] [2024-11-13 15:57:26,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827272219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:57:26,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:57:26,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:57:26,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096157299] [2024-11-13 15:57:26,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:57:26,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:57:26,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:57:26,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:57:26,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:57:26,287 INFO L87 Difference]: Start difference. First operand 245 states and 345 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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 15:57:26,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:57:26,539 INFO L93 Difference]: Finished difference Result 401 states and 566 transitions. [2024-11-13 15:57:26,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:57:26,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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 79 [2024-11-13 15:57:26,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:57:26,541 INFO L225 Difference]: With dead ends: 401 [2024-11-13 15:57:26,541 INFO L226 Difference]: Without dead ends: 257 [2024-11-13 15:57:26,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:57:26,542 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 376 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:57:26,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 747 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:57:26,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-13 15:57:26,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 244. [2024-11-13 15:57:26,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.4032921810699588) internal successors, (341), 243 states have internal predecessors, (341), 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 15:57:26,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 341 transitions. [2024-11-13 15:57:26,551 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 341 transitions. Word has length 79 [2024-11-13 15:57:26,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:57:26,551 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 341 transitions. [2024-11-13 15:57:26,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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 15:57:26,552 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 341 transitions. [2024-11-13 15:57:26,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-13 15:57:26,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:57:26,552 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:57:26,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 15:57:26,553 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:57:26,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:57:26,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1495535523, now seen corresponding path program 1 times [2024-11-13 15:57:26,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:57:26,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971041122] [2024-11-13 15:57:26,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:57:26,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:57:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:57:29,509 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:57:29,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:57:29,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971041122] [2024-11-13 15:57:29,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971041122] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:57:29,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433795477] [2024-11-13 15:57:29,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:57:29,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:57:29,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:57:29,513 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:57:29,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:57:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:57:30,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-13 15:57:30,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:57:31,685 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:57:31,685 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:57:33,746 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:57:33,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433795477] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:57:33,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:57:33,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 12] total 31 [2024-11-13 15:57:33,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856697823] [2024-11-13 15:57:33,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:57:33,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-13 15:57:33,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:57:33,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-13 15:57:33,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930 [2024-11-13 15:57:33,750 INFO L87 Difference]: Start difference. First operand 244 states and 341 transitions. Second operand has 31 states, 31 states have (on average 6.774193548387097) internal successors, (210), 31 states have internal predecessors, (210), 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 15:57:35,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:57:35,508 INFO L93 Difference]: Finished difference Result 597 states and 840 transitions. [2024-11-13 15:57:35,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 15:57:35,509 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 6.774193548387097) internal successors, (210), 31 states have internal predecessors, (210), 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 79 [2024-11-13 15:57:35,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:57:35,513 INFO L225 Difference]: With dead ends: 597 [2024-11-13 15:57:35,513 INFO L226 Difference]: Without dead ends: 468 [2024-11-13 15:57:35,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=349, Invalid=1813, Unknown=0, NotChecked=0, Total=2162 [2024-11-13 15:57:35,517 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 1573 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:57:35,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 1397 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 15:57:35,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-13 15:57:35,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 425. [2024-11-13 15:57:35,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.4103773584905661) internal successors, (598), 424 states have internal predecessors, (598), 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 15:57:35,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 598 transitions. [2024-11-13 15:57:35,552 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 598 transitions. Word has length 79 [2024-11-13 15:57:35,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:57:35,553 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 598 transitions. [2024-11-13 15:57:35,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 6.774193548387097) internal successors, (210), 31 states have internal predecessors, (210), 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 15:57:35,553 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 598 transitions. [2024-11-13 15:57:35,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-13 15:57:35,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:57:35,557 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:57:35,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 15:57:35,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-13 15:57:35,758 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:57:35,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:57:35,758 INFO L85 PathProgramCache]: Analyzing trace with hash -260135665, now seen corresponding path program 1 times [2024-11-13 15:57:35,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:57:35,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971114885] [2024-11-13 15:57:35,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:57:35,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:57:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:57:36,730 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:57:36,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:57:36,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971114885] [2024-11-13 15:57:36,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971114885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:57:36,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:57:36,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:57:36,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695644674] [2024-11-13 15:57:36,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:57:36,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:57:36,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:57:36,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:57:36,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:57:36,735 INFO L87 Difference]: Start difference. First operand 425 states and 598 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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 15:57:36,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:57:36,913 INFO L93 Difference]: Finished difference Result 823 states and 1164 transitions. [2024-11-13 15:57:36,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:57:36,915 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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 80 [2024-11-13 15:57:36,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:57:36,917 INFO L225 Difference]: With dead ends: 823 [2024-11-13 15:57:36,917 INFO L226 Difference]: Without dead ends: 440 [2024-11-13 15:57:36,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:57:36,920 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 145 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:57:36,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 676 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:57:36,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-13 15:57:36,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2024-11-13 15:57:36,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 1.4031890660592254) internal successors, (616), 439 states have internal predecessors, (616), 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 15:57:36,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 616 transitions. [2024-11-13 15:57:36,937 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 616 transitions. Word has length 80 [2024-11-13 15:57:36,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:57:36,937 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 616 transitions. [2024-11-13 15:57:36,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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 15:57:36,937 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 616 transitions. [2024-11-13 15:57:36,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-13 15:57:36,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:57:36,938 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-13 15:57:36,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 15:57:36,939 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:57:36,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:57:36,939 INFO L85 PathProgramCache]: Analyzing trace with hash 953061061, now seen corresponding path program 1 times [2024-11-13 15:57:36,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:57:36,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174810085] [2024-11-13 15:57:36,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:57:36,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:57:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:57:38,479 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:57:38,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:57:38,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174810085] [2024-11-13 15:57:38,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174810085] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:57:38,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814126987] [2024-11-13 15:57:38,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:57:38,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:57:38,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:57:38,484 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:57:38,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 15:57:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:57:39,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 15:57:39,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:57:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 15:57:39,976 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:57:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 15:57:40,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814126987] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:57:40,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:57:40,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 19 [2024-11-13 15:57:40,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291314799] [2024-11-13 15:57:40,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:57:40,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 15:57:40,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:57:40,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 15:57:40,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2024-11-13 15:57:40,884 INFO L87 Difference]: Start difference. First operand 440 states and 616 transitions. Second operand has 19 states, 19 states have (on average 11.473684210526315) internal successors, (218), 19 states have internal predecessors, (218), 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 15:57:42,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:57:42,789 INFO L93 Difference]: Finished difference Result 841 states and 1183 transitions. [2024-11-13 15:57:42,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 15:57:42,790 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 11.473684210526315) internal successors, (218), 19 states have internal predecessors, (218), 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 80 [2024-11-13 15:57:42,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:57:42,793 INFO L225 Difference]: With dead ends: 841 [2024-11-13 15:57:42,794 INFO L226 Difference]: Without dead ends: 589 [2024-11-13 15:57:42,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2024-11-13 15:57:42,799 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 462 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 1710 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:57:42,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1655 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1710 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 15:57:42,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-13 15:57:42,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 440. [2024-11-13 15:57:42,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 1.4031890660592254) internal successors, (616), 439 states have internal predecessors, (616), 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 15:57:42,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 616 transitions. [2024-11-13 15:57:42,818 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 616 transitions. Word has length 80 [2024-11-13 15:57:42,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:57:42,818 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 616 transitions. [2024-11-13 15:57:42,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.473684210526315) internal successors, (218), 19 states have internal predecessors, (218), 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 15:57:42,818 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 616 transitions. [2024-11-13 15:57:42,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-13 15:57:42,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:57:42,824 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:57:42,850 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 15:57:43,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-13 15:57:43,029 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:57:43,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:57:43,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1448209989, now seen corresponding path program 1 times [2024-11-13 15:57:43,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:57:43,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552916736] [2024-11-13 15:57:43,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:57:43,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:57:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:57:45,000 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:57:45,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:57:45,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552916736] [2024-11-13 15:57:45,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552916736] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:57:45,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628596260] [2024-11-13 15:57:45,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:57:45,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:57:45,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:57:45,003 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:57:45,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 15:57:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:57:45,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-13 15:57:45,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:57:46,784 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:57:46,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:57:49,053 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:57:49,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628596260] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:57:49,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:57:49,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 29 [2024-11-13 15:57:49,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331840761] [2024-11-13 15:57:49,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:57:49,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-13 15:57:49,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:57:49,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 15:57:49,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2024-11-13 15:57:49,058 INFO L87 Difference]: Start difference. First operand 440 states and 616 transitions. Second operand has 29 states, 29 states have (on average 7.862068965517241) internal successors, (228), 29 states have internal predecessors, (228), 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 15:57:50,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:57:50,395 INFO L93 Difference]: Finished difference Result 811 states and 1140 transitions. [2024-11-13 15:57:50,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 15:57:50,397 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.862068965517241) internal successors, (228), 29 states have internal predecessors, (228), 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 81 [2024-11-13 15:57:50,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:57:50,400 INFO L225 Difference]: With dead ends: 811 [2024-11-13 15:57:50,401 INFO L226 Difference]: Without dead ends: 559 [2024-11-13 15:57:50,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=190, Invalid=1070, Unknown=0, NotChecked=0, Total=1260 [2024-11-13 15:57:50,405 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 443 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1721 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:57:50,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1721 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 15:57:50,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-11-13 15:57:50,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 444. [2024-11-13 15:57:50,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 1.399548532731377) internal successors, (620), 443 states have internal predecessors, (620), 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 15:57:50,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 620 transitions. [2024-11-13 15:57:50,425 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 620 transitions. Word has length 81 [2024-11-13 15:57:50,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:57:50,425 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 620 transitions. [2024-11-13 15:57:50,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.862068965517241) internal successors, (228), 29 states have internal predecessors, (228), 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 15:57:50,426 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 620 transitions. [2024-11-13 15:57:50,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-13 15:57:50,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:57:50,429 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:57:50,460 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 15:57:50,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:57:50,630 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:57:50,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:57:50,630 INFO L85 PathProgramCache]: Analyzing trace with hash 107287140, now seen corresponding path program 1 times [2024-11-13 15:57:50,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:57:50,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39992008] [2024-11-13 15:57:50,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:57:50,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:57:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:57:50,979 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:57:50,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:57:50,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39992008] [2024-11-13 15:57:50,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39992008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:57:50,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:57:50,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:57:50,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279529321] [2024-11-13 15:57:50,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:57:50,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:57:50,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:57:50,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:57:50,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:57:50,983 INFO L87 Difference]: Start difference. First operand 444 states and 620 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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 15:57:51,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:57:51,041 INFO L93 Difference]: Finished difference Result 899 states and 1260 transitions. [2024-11-13 15:57:51,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:57:51,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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 81 [2024-11-13 15:57:51,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:57:51,044 INFO L225 Difference]: With dead ends: 899 [2024-11-13 15:57:51,044 INFO L226 Difference]: Without dead ends: 500 [2024-11-13 15:57:51,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:57:51,046 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 16 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:57:51,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 640 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:57:51,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2024-11-13 15:57:51,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 480. [2024-11-13 15:57:51,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 1.394572025052192) internal successors, (668), 479 states have internal predecessors, (668), 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 15:57:51,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 668 transitions. [2024-11-13 15:57:51,065 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 668 transitions. Word has length 81 [2024-11-13 15:57:51,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:57:51,065 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 668 transitions. [2024-11-13 15:57:51,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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 15:57:51,066 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 668 transitions. [2024-11-13 15:57:51,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-13 15:57:51,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:57:51,068 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:57:51,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 15:57:51,068 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:57:51,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:57:51,069 INFO L85 PathProgramCache]: Analyzing trace with hash 790874219, now seen corresponding path program 1 times [2024-11-13 15:57:51,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:57:51,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312555768] [2024-11-13 15:57:51,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:57:51,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:57:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:57:51,909 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:57:51,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:57:51,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312555768] [2024-11-13 15:57:51,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312555768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:57:51,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:57:51,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:57:51,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786853416] [2024-11-13 15:57:51,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:57:51,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:57:51,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:57:51,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:57:51,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:57:51,911 INFO L87 Difference]: Start difference. First operand 480 states and 668 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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 15:57:51,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:57:51,995 INFO L93 Difference]: Finished difference Result 930 states and 1301 transitions. [2024-11-13 15:57:51,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:57:51,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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 81 [2024-11-13 15:57:51,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:57:51,998 INFO L225 Difference]: With dead ends: 930 [2024-11-13 15:57:51,998 INFO L226 Difference]: Without dead ends: 504 [2024-11-13 15:57:51,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:57:52,000 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 146 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:57:52,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 602 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:57:52,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-11-13 15:57:52,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 498. [2024-11-13 15:57:52,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 497 states have (on average 1.392354124748491) internal successors, (692), 497 states have internal predecessors, (692), 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 15:57:52,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 692 transitions. [2024-11-13 15:57:52,015 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 692 transitions. Word has length 81 [2024-11-13 15:57:52,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:57:52,016 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 692 transitions. [2024-11-13 15:57:52,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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 15:57:52,016 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 692 transitions. [2024-11-13 15:57:52,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-13 15:57:52,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:57:52,018 INFO L215 NwaCegarLoop]: trace histogram [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 15:57:52,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 15:57:52,018 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:57:52,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:57:52,019 INFO L85 PathProgramCache]: Analyzing trace with hash -785585405, now seen corresponding path program 1 times [2024-11-13 15:57:52,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:57:52,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552455726] [2024-11-13 15:57:52,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:57:52,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:57:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:57:52,583 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:57:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:57:53,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:57:53,251 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 15:57:53,252 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 15:57:53,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 15:57:53,263 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:57:53,361 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 15:57:53,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 03:57:53 BoogieIcfgContainer [2024-11-13 15:57:53,365 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 15:57:53,366 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 15:57:53,366 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 15:57:53,366 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 15:57:53,367 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:57:07" (3/4) ... [2024-11-13 15:57:53,373 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 15:57:53,374 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 15:57:53,376 INFO L158 Benchmark]: Toolchain (without parser) took 48422.41ms. Allocated memory was 117.4MB in the beginning and 654.3MB in the end (delta: 536.9MB). Free memory was 94.5MB in the beginning and 603.9MB in the end (delta: -509.4MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2024-11-13 15:57:53,377 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 167.8MB. Free memory is still 103.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:57:53,377 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.53ms. Allocated memory is still 117.4MB. Free memory was 94.1MB in the beginning and 75.5MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 15:57:53,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.84ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 64.4MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:57:53,378 INFO L158 Benchmark]: Boogie Preprocessor took 116.65ms. Allocated memory is still 117.4MB. Free memory was 64.4MB in the beginning and 56.9MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:57:53,379 INFO L158 Benchmark]: RCFGBuilder took 1613.43ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 56.9MB in the beginning and 315.9MB in the end (delta: -259.0MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2024-11-13 15:57:53,379 INFO L158 Benchmark]: TraceAbstraction took 46062.12ms. Allocated memory was 352.3MB in the beginning and 654.3MB in the end (delta: 302.0MB). Free memory was 315.3MB in the beginning and 604.0MB in the end (delta: -288.6MB). Peak memory consumption was 386.7MB. Max. memory is 16.1GB. [2024-11-13 15:57:53,380 INFO L158 Benchmark]: Witness Printer took 8.44ms. Allocated memory is still 654.3MB. Free memory was 604.0MB in the beginning and 603.9MB in the end (delta: 87.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:57:53,382 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.37ms. Allocated memory is still 167.8MB. Free memory is still 103.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 493.53ms. Allocated memory is still 117.4MB. Free memory was 94.1MB in the beginning and 75.5MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 119.84ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 64.4MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 116.65ms. Allocated memory is still 117.4MB. Free memory was 64.4MB in the beginning and 56.9MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1613.43ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 56.9MB in the beginning and 315.9MB in the end (delta: -259.0MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. * TraceAbstraction took 46062.12ms. Allocated memory was 352.3MB in the beginning and 654.3MB in the end (delta: 302.0MB). Free memory was 315.3MB in the beginning and 604.0MB in the end (delta: -288.6MB). Peak memory consumption was 386.7MB. Max. memory is 16.1GB. * Witness Printer took 8.44ms. Allocated memory is still 654.3MB. Free memory was 604.0MB in the beginning and 603.9MB in the end (delta: 87.7kB). 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 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 88, overapproximation of bitwiseAnd at line 284, overapproximation of bitwiseAnd at line 81, overapproximation of bitwiseAnd at line 93. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 32); [L30] const SORT_7 msb_SORT_7 = (SORT_7)1 << (32 - 1); [L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 3); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (3 - 1); [L35] const SORT_47 mask_SORT_47 = (SORT_47)-1 >> (sizeof(SORT_47) * 8 - 2); [L36] const SORT_47 msb_SORT_47 = (SORT_47)1 << (2 - 1); [L38] const SORT_1 var_4 = 0; [L39] const SORT_7 var_9 = 1; [L40] const SORT_12 var_13 = 0; [L41] const SORT_1 var_21 = 1; [L42] const SORT_12 var_28 = 2; [L43] const SORT_12 var_31 = 1; [L44] const SORT_12 var_35 = 4; [L45] const SORT_12 var_38 = 6; [L46] const SORT_12 var_41 = 5; [L47] const SORT_12 var_45 = 3; [L48] const SORT_7 var_57 = 0; [L50] SORT_1 input_2; [L51] SORT_1 input_3; [L52] SORT_12 input_55; [L53] SORT_12 input_62; [L54] SORT_12 input_75; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L56] SORT_1 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L57] SORT_12 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_12; [L59] SORT_1 init_6_arg_1 = var_4; [L60] state_5 = init_6_arg_1 [L61] SORT_12 init_15_arg_1 = var_13; [L62] state_14 = init_15_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L65] input_2 = __VERIFIER_nondet_uchar() [L66] input_3 = __VERIFIER_nondet_uchar() [L67] input_55 = __VERIFIER_nondet_uchar() [L68] input_62 = __VERIFIER_nondet_uchar() [L69] input_75 = __VERIFIER_nondet_uchar() [L72] SORT_1 var_8_arg_0 = state_5; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_8_arg_0=0, var_9=1] [L73] EXPR var_8_arg_0 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L73] var_8_arg_0 = var_8_arg_0 & mask_SORT_1 [L74] SORT_7 var_8 = var_8_arg_0; [L75] SORT_7 var_10_arg_0 = var_8; [L76] SORT_7 var_10_arg_1 = var_9; [L77] SORT_1 var_10 = var_10_arg_0 == var_10_arg_1; [L78] SORT_1 var_11_arg_0 = var_10; [L79] SORT_1 var_11 = ~var_11_arg_0; [L80] SORT_12 var_16_arg_0 = state_14; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_11=-1, var_13=0, var_16_arg_0=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L81] EXPR var_16_arg_0 & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_11=-1, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L81] var_16_arg_0 = var_16_arg_0 & mask_SORT_12 [L82] SORT_7 var_16 = var_16_arg_0; [L83] SORT_7 var_17_arg_0 = var_16; [L84] SORT_7 var_17_arg_1 = var_9; [L85] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L86] SORT_1 var_18_arg_0 = var_11; [L87] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_18_arg_0=-1, var_18_arg_1=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L88] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L88] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L89] SORT_1 var_22_arg_0 = var_18; [L90] SORT_1 var_22 = ~var_22_arg_0; [L91] SORT_1 var_23_arg_0 = var_21; [L92] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_23_arg_0=1, var_23_arg_1=-256, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L93] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L93] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L94] EXPR var_23 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L94] var_23 = var_23 & mask_SORT_1 [L95] SORT_1 bad_24_arg_0 = var_23; [L96] CALL __VERIFIER_assert(!(bad_24_arg_0)) [L21] COND FALSE !(!(cond)) [L96] RET __VERIFIER_assert(!(bad_24_arg_0)) [L98] SORT_12 var_42_arg_0 = state_14; [L99] SORT_12 var_42_arg_1 = var_41; [L100] SORT_1 var_42 = var_42_arg_0 == var_42_arg_1; [L101] SORT_12 var_39_arg_0 = state_14; [L102] SORT_12 var_39_arg_1 = var_38; [L103] SORT_1 var_39 = var_39_arg_0 == var_39_arg_1; [L104] SORT_1 var_43_arg_0 = var_42; [L105] SORT_1 var_43_arg_1 = var_39; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_39=0, var_41=5, var_43_arg_0=0, var_43_arg_1=0, var_45=3, var_4=0, var_57=0, var_9=1] [L106] EXPR var_43_arg_0 | var_43_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_39=0, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L106] SORT_1 var_43 = var_43_arg_0 | var_43_arg_1; [L107] EXPR var_43 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_39=0, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L107] var_43 = var_43 & mask_SORT_1 [L108] SORT_12 var_36_arg_0 = state_14; [L109] SORT_12 var_36_arg_1 = var_35; [L110] SORT_1 var_36 = var_36_arg_0 == var_36_arg_1; [L111] SORT_12 var_46_arg_0 = state_14; [L112] SORT_12 var_46_arg_1 = var_45; [L113] SORT_1 var_46 = var_46_arg_0 == var_46_arg_1; [L114] SORT_1 var_48_arg_0 = var_36; [L115] SORT_1 var_48_arg_1 = var_46; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_48_arg_0=0, var_48_arg_1=0, var_4=0, var_57=0, var_9=1] [L116] EXPR ((SORT_47)var_48_arg_0 << 1) | var_48_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_4=0, var_57=0, var_9=1] [L116] SORT_47 var_48 = ((SORT_47)var_48_arg_0 << 1) | var_48_arg_1; [L117] EXPR var_48 & mask_SORT_47 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_4=0, var_57=0, var_9=1] [L117] var_48 = var_48 & mask_SORT_47 [L118] SORT_1 var_49_arg_0 = var_43; [L119] SORT_47 var_49_arg_1 = var_48; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_49_arg_0=0, var_49_arg_1=0, var_4=0, var_57=0, var_9=1] [L120] EXPR ((SORT_12)var_49_arg_0 << 2) | var_49_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_4=0, var_57=0, var_9=1] [L120] SORT_12 var_49 = ((SORT_12)var_49_arg_0 << 2) | var_49_arg_1; [L121] EXPR var_49 & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_4=0, var_57=0, var_9=1] [L121] var_49 = var_49 & mask_SORT_12 [L122] SORT_12 var_50_arg_0 = var_49; [L123] SORT_1 var_50 = var_50_arg_0 != 0; [L124] SORT_1 var_40_arg_0 = var_39; [L125] SORT_1 var_40_arg_1 = var_4; [L126] SORT_1 var_40_arg_2 = var_4; [L127] SORT_1 var_40 = var_40_arg_0 ? var_40_arg_1 : var_40_arg_2; [L128] SORT_1 var_37_arg_0 = var_36; [L129] SORT_1 var_37_arg_1 = var_21; [L130] SORT_1 var_37_arg_2 = var_4; [L131] SORT_1 var_37 = var_37_arg_0 ? var_37_arg_1 : var_37_arg_2; [L132] SORT_1 var_44_arg_0 = var_43; [L133] SORT_1 var_44_arg_1 = var_40; [L134] SORT_1 var_44_arg_2 = var_37; [L135] SORT_1 var_44 = var_44_arg_0 ? var_44_arg_1 : var_44_arg_2; [L136] SORT_12 var_32_arg_0 = state_14; [L137] SORT_12 var_32_arg_1 = var_31; [L138] SORT_1 var_32 = var_32_arg_0 == var_32_arg_1; [L139] SORT_12 var_29_arg_0 = state_14; [L140] SORT_12 var_29_arg_1 = var_28; [L141] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L142] SORT_1 var_33_arg_0 = var_32; [L143] SORT_1 var_33_arg_1 = var_29; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_29=0, var_31=1, var_33_arg_0=0, var_33_arg_1=0, var_35=4, var_38=6, var_41=5, var_44=0, var_45=3, var_4=0, var_50=0, var_57=0, var_9=1] [L144] EXPR var_33_arg_0 | var_33_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_29=0, var_31=1, var_35=4, var_38=6, var_41=5, var_44=0, var_45=3, var_4=0, var_50=0, var_57=0, var_9=1] [L144] SORT_1 var_33 = var_33_arg_0 | var_33_arg_1; [L145] EXPR var_33 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_29=0, var_31=1, var_35=4, var_38=6, var_41=5, var_44=0, var_45=3, var_4=0, var_50=0, var_57=0, var_9=1] [L145] var_33 = var_33 & mask_SORT_1 [L146] SORT_1 var_30_arg_0 = var_29; [L147] SORT_1 var_30_arg_1 = var_4; [L148] SORT_1 var_30_arg_2 = var_4; [L149] SORT_1 var_30 = var_30_arg_0 ? var_30_arg_1 : var_30_arg_2; [L150] SORT_12 var_26_arg_0 = state_14; [L151] SORT_12 var_26_arg_1 = var_13; [L152] SORT_1 var_26 = var_26_arg_0 == var_26_arg_1; [L153] SORT_1 var_27_arg_0 = var_26; [L154] SORT_1 var_27_arg_1 = var_4; [L155] SORT_1 var_27_arg_2 = state_5; [L156] SORT_1 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L157] SORT_1 var_34_arg_0 = var_33; [L158] SORT_1 var_34_arg_1 = var_30; [L159] SORT_1 var_34_arg_2 = var_27; [L160] SORT_1 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L161] SORT_1 var_51_arg_0 = var_50; [L162] SORT_1 var_51_arg_1 = var_44; [L163] SORT_1 var_51_arg_2 = var_34; [L164] SORT_1 var_51 = var_51_arg_0 ? var_51_arg_1 : var_51_arg_2; [L165] SORT_1 next_52_arg_1 = var_51; [L166] SORT_12 var_83_arg_0 = state_14; [L167] SORT_12 var_83_arg_1 = var_41; [L168] SORT_1 var_83 = var_83_arg_0 == var_83_arg_1; [L169] SORT_12 var_81_arg_0 = state_14; [L170] SORT_12 var_81_arg_1 = var_38; [L171] SORT_1 var_81 = var_81_arg_0 == var_81_arg_1; [L172] SORT_1 var_84_arg_0 = var_83; [L173] SORT_1 var_84_arg_1 = var_81; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_81=0, var_84_arg_0=0, var_84_arg_1=0, var_9=1] [L174] EXPR var_84_arg_0 | var_84_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_81=0, var_9=1] [L174] SORT_1 var_84 = var_84_arg_0 | var_84_arg_1; [L175] EXPR var_84 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_81=0, var_9=1] [L175] var_84 = var_84 & mask_SORT_1 [L176] SORT_12 var_73_arg_0 = state_14; [L177] SORT_12 var_73_arg_1 = var_35; [L178] SORT_1 var_73 = var_73_arg_0 == var_73_arg_1; [L179] SORT_12 var_86_arg_0 = state_14; [L180] SORT_12 var_86_arg_1 = var_45; [L181] SORT_1 var_86 = var_86_arg_0 == var_86_arg_1; [L182] SORT_1 var_87_arg_0 = var_73; [L183] SORT_1 var_87_arg_1 = var_86; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_87_arg_0=0, var_87_arg_1=0, var_9=1] [L184] EXPR ((SORT_47)var_87_arg_0 << 1) | var_87_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_9=1] [L184] SORT_47 var_87 = ((SORT_47)var_87_arg_0 << 1) | var_87_arg_1; [L185] EXPR var_87 & mask_SORT_47 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_9=1] [L185] var_87 = var_87 & mask_SORT_47 [L186] SORT_1 var_88_arg_0 = var_84; [L187] SORT_47 var_88_arg_1 = var_87; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_88_arg_0=0, var_88_arg_1=0, var_9=1] [L188] EXPR ((SORT_12)var_88_arg_0 << 2) | var_88_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_9=1] [L188] SORT_12 var_88 = ((SORT_12)var_88_arg_0 << 2) | var_88_arg_1; [L189] EXPR var_88 & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_9=1] [L189] var_88 = var_88 & mask_SORT_12 [L190] SORT_12 var_89_arg_0 = var_88; [L191] SORT_1 var_89 = var_89_arg_0 != 0; [L192] SORT_12 var_79_arg_0 = state_14; [L193] SORT_12 var_79_arg_1 = var_38; [L194] SORT_1 var_79 = var_79_arg_0 == var_79_arg_1; [L195] SORT_1 var_76_arg_0 = input_2; VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_76_arg_0=0, var_79=0, var_81=0, var_84=0, var_89=0, var_9=1] [L196] EXPR var_76_arg_0 & mask_SORT_1 VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_79=0, var_81=0, var_84=0, var_89=0, var_9=1] [L196] var_76_arg_0 = var_76_arg_0 & mask_SORT_1 [L197] SORT_7 var_76 = var_76_arg_0; [L198] SORT_7 var_77_arg_0 = var_76; [L199] SORT_7 var_77_arg_1 = var_57; [L200] SORT_1 var_77 = var_77_arg_0 == var_77_arg_1; [L201] SORT_1 var_78_arg_0 = var_77; [L202] SORT_12 var_78_arg_1 = var_35; [L203] SORT_12 var_78_arg_2 = var_13; [L204] SORT_12 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L205] SORT_1 var_80_arg_0 = var_79; [L206] SORT_12 var_80_arg_1 = var_78; [L207] SORT_12 var_80_arg_2 = input_75; [L208] SORT_12 var_80 = var_80_arg_0 ? var_80_arg_1 : var_80_arg_2; [L209] SORT_1 var_82_arg_0 = var_81; [L210] SORT_12 var_82_arg_1 = var_80; [L211] SORT_12 var_82_arg_2 = var_38; [L212] SORT_12 var_82 = var_82_arg_0 ? var_82_arg_1 : var_82_arg_2; [L213] SORT_1 var_74_arg_0 = var_73; [L214] SORT_12 var_74_arg_1 = var_31; [L215] SORT_12 var_74_arg_2 = var_35; [L216] SORT_12 var_74 = var_74_arg_0 ? var_74_arg_1 : var_74_arg_2; [L217] SORT_1 var_85_arg_0 = var_84; [L218] SORT_12 var_85_arg_1 = var_82; [L219] SORT_12 var_85_arg_2 = var_74; [L220] SORT_12 var_85 = var_85_arg_0 ? var_85_arg_1 : var_85_arg_2; [L221] SORT_12 var_70_arg_0 = state_14; [L222] SORT_12 var_70_arg_1 = var_31; [L223] SORT_1 var_70 = var_70_arg_0 == var_70_arg_1; [L224] SORT_12 var_68_arg_0 = state_14; [L225] SORT_12 var_68_arg_1 = var_28; [L226] SORT_1 var_68 = var_68_arg_0 == var_68_arg_1; [L227] SORT_1 var_71_arg_0 = var_70; [L228] SORT_1 var_71_arg_1 = var_68; VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_68=0, var_71_arg_0=0, var_71_arg_1=0, var_85=4, var_89=0, var_9=1] [L229] EXPR var_71_arg_0 | var_71_arg_1 VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_68=0, var_85=4, var_89=0, var_9=1] [L229] SORT_1 var_71 = var_71_arg_0 | var_71_arg_1; [L230] EXPR var_71 & mask_SORT_1 VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_68=0, var_85=4, var_89=0, var_9=1] [L230] var_71 = var_71 & mask_SORT_1 [L231] SORT_12 var_66_arg_0 = state_14; [L232] SORT_12 var_66_arg_1 = var_28; [L233] SORT_1 var_66 = var_66_arg_0 == var_66_arg_1; [L234] SORT_1 var_63_arg_0 = input_2; VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_63_arg_0=0, var_66=0, var_68=0, var_71=0, var_85=4, var_89=0, var_9=1] [L235] EXPR var_63_arg_0 & mask_SORT_1 VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_66=0, var_68=0, var_71=0, var_85=4, var_89=0, var_9=1] [L235] var_63_arg_0 = var_63_arg_0 & mask_SORT_1 [L236] SORT_7 var_63 = var_63_arg_0; [L237] SORT_7 var_64_arg_0 = var_63; [L238] SORT_7 var_64_arg_1 = var_57; [L239] SORT_1 var_64 = var_64_arg_0 == var_64_arg_1; [L240] SORT_1 var_65_arg_0 = var_64; [L241] SORT_12 var_65_arg_1 = var_45; [L242] SORT_12 var_65_arg_2 = var_38; [L243] SORT_12 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L244] SORT_1 var_67_arg_0 = var_66; [L245] SORT_12 var_67_arg_1 = var_65; [L246] SORT_12 var_67_arg_2 = input_62; [L247] SORT_12 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L248] SORT_12 var_60_arg_0 = state_14; [L249] SORT_12 var_60_arg_1 = var_31; [L250] SORT_1 var_60 = var_60_arg_0 == var_60_arg_1; [L251] SORT_1 var_56_arg_0 = input_2; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_56_arg_0=0, var_57=0, var_60=0, var_67=3, var_68=0, var_71=0, var_85=4, var_89=0, var_9=1] [L252] EXPR var_56_arg_0 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_60=0, var_67=3, var_68=0, var_71=0, var_85=4, var_89=0, var_9=1] [L252] var_56_arg_0 = var_56_arg_0 & mask_SORT_1 [L253] SORT_7 var_56 = var_56_arg_0; [L254] SORT_7 var_58_arg_0 = var_56; [L255] SORT_7 var_58_arg_1 = var_57; [L256] SORT_1 var_58 = var_58_arg_0 == var_58_arg_1; [L257] SORT_1 var_59_arg_0 = var_58; [L258] SORT_12 var_59_arg_1 = var_28; [L259] SORT_12 var_59_arg_2 = var_41; [L260] SORT_12 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L261] SORT_1 var_61_arg_0 = var_60; [L262] SORT_12 var_61_arg_1 = var_59; [L263] SORT_12 var_61_arg_2 = input_55; [L264] SORT_12 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L265] SORT_1 var_69_arg_0 = var_68; [L266] SORT_12 var_69_arg_1 = var_67; [L267] SORT_12 var_69_arg_2 = var_61; [L268] SORT_12 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L269] SORT_12 var_53_arg_0 = state_14; [L270] SORT_12 var_53_arg_1 = var_13; [L271] SORT_1 var_53 = var_53_arg_0 == var_53_arg_1; [L272] SORT_1 var_54_arg_0 = var_53; [L273] SORT_12 var_54_arg_1 = var_31; [L274] SORT_12 var_54_arg_2 = state_14; [L275] SORT_12 var_54 = var_54_arg_0 ? var_54_arg_1 : var_54_arg_2; [L276] SORT_1 var_72_arg_0 = var_71; [L277] SORT_12 var_72_arg_1 = var_69; [L278] SORT_12 var_72_arg_2 = var_54; [L279] SORT_12 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L280] SORT_1 var_90_arg_0 = var_89; [L281] SORT_12 var_90_arg_1 = var_85; [L282] SORT_12 var_90_arg_2 = var_72; [L283] SORT_12 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_90=1, var_9=1] [L284] EXPR var_90 & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L284] var_90 = var_90 & mask_SORT_12 [L285] SORT_12 next_91_arg_1 = var_90; [L287] state_5 = next_52_arg_1 [L288] state_14 = next_91_arg_1 [L65] input_2 = __VERIFIER_nondet_uchar() [L66] input_3 = __VERIFIER_nondet_uchar() [L67] input_55 = __VERIFIER_nondet_uchar() [L68] input_62 = __VERIFIER_nondet_uchar() [L69] input_75 = __VERIFIER_nondet_uchar() [L72] SORT_1 var_8_arg_0 = state_5; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_8_arg_0=0, var_9=1] [L73] EXPR var_8_arg_0 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L73] var_8_arg_0 = var_8_arg_0 & mask_SORT_1 [L74] SORT_7 var_8 = var_8_arg_0; [L75] SORT_7 var_10_arg_0 = var_8; [L76] SORT_7 var_10_arg_1 = var_9; [L77] SORT_1 var_10 = var_10_arg_0 == var_10_arg_1; [L78] SORT_1 var_11_arg_0 = var_10; [L79] SORT_1 var_11 = ~var_11_arg_0; [L80] SORT_12 var_16_arg_0 = state_14; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_11=-1, var_13=0, var_16_arg_0=1, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L81] EXPR var_16_arg_0 & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_11=-1, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L81] var_16_arg_0 = var_16_arg_0 & mask_SORT_12 [L82] SORT_7 var_16 = var_16_arg_0; [L83] SORT_7 var_17_arg_0 = var_16; [L84] SORT_7 var_17_arg_1 = var_9; [L85] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L86] SORT_1 var_18_arg_0 = var_11; [L87] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_18_arg_0=-1, var_18_arg_1=1, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L88] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L88] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L89] SORT_1 var_22_arg_0 = var_18; [L90] SORT_1 var_22 = ~var_22_arg_0; [L91] SORT_1 var_23_arg_0 = var_21; [L92] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_23_arg_0=1, var_23_arg_1=-1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L93] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L93] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L94] EXPR var_23 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L94] var_23 = var_23 & mask_SORT_1 [L95] SORT_1 bad_24_arg_0 = var_23; [L96] CALL __VERIFIER_assert(!(bad_24_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.9s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5357 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5357 mSDsluCounter, 13814 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11188 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5330 IncrementalHoareTripleChecker+Invalid, 5355 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 2626 mSDtfsCounter, 5330 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 746 GetRequests, 546 SyntacticMatches, 3 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=498occurred in iteration=18, InterpolantAutomatonStates: 140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 547 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 7.5s SatisfiabilityAnalysisTime, 25.6s InterpolantComputationTime, 1367 NumberOfCodeBlocks, 1367 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1500 ConstructedInterpolants, 0 QuantifiedInterpolants, 12195 SizeOfPredicates, 16 NumberOfNonLiveVariables, 2735 ConjunctsInSsa, 253 ConjunctsInUnsatCore, 25 InterpolantComputations, 15 PerfectInterpolantSequences, 183/221 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 15:57:53,434 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/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_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/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 64bit --witnessprinter.graph.data.programhash e188a971cba665e2b77b0e826b47d617ddf57bd12a8f8136f6d81bf903c7591b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:57:56,664 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:57:56,832 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-13 15:57:56,843 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:57:56,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:57:56,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:57:56,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:57:56,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:57:56,882 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:57:56,882 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:57:56,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:57:56,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:57:56,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:57:56,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:57:56,886 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:57:56,886 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:57:56,887 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:57:56,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:57:56,887 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:57:56,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:57:56,887 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:57:56,887 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:57:56,887 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 15:57:56,888 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:57:56,888 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 15:57:56,888 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:57:56,888 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:57:56,888 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:57:56,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:57:56,889 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:57:56,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:57:56,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:57:56,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:57:56,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:57:56,889 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:57:56,889 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 15:57:56,889 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 15:57:56,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:57:56,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:57:56,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:57:56,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:57:56,891 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_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e188a971cba665e2b77b0e826b47d617ddf57bd12a8f8136f6d81bf903c7591b [2024-11-13 15:57:57,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:57:57,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:57:57,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:57:57,297 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:57:57,297 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:57:57,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c Unable to find full path for "g++" [2024-11-13 15:57:59,759 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:58:00,085 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:58:00,086 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c [2024-11-13 15:58:00,107 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/data/713441fa6/ae9f8aa16e0d4f459b7425052f886f9d/FLAGbcfb7ad0f [2024-11-13 15:58:00,138 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/data/713441fa6/ae9f8aa16e0d4f459b7425052f886f9d [2024-11-13 15:58:00,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:58:00,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:58:00,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:58:00,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:58:00,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:58:00,154 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:58:00" (1/1) ... [2024-11-13 15:58:00,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2072d53a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:00, skipping insertion in model container [2024-11-13 15:58:00,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:58:00" (1/1) ... [2024-11-13 15:58:00,193 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:58:00,431 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_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c[1245,1258] [2024-11-13 15:58:00,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:58:00,638 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:58:00,658 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_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c[1245,1258] [2024-11-13 15:58:00,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:58:00,766 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:58:00,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:00 WrapperNode [2024-11-13 15:58:00,767 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:58:00,768 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:58:00,769 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:58:00,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:58:00,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 03:58:00" (1/1) ... [2024-11-13 15:58:00,792 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:00" (1/1) ... [2024-11-13 15:58:00,843 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 290 [2024-11-13 15:58:00,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:58:00,848 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:58:00,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:58:00,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:58:00,865 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:00" (1/1) ... [2024-11-13 15:58:00,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:00" (1/1) ... [2024-11-13 15:58:00,882 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:00" (1/1) ... [2024-11-13 15:58:00,918 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-13 15:58:00,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:00" (1/1) ... [2024-11-13 15:58:00,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:00" (1/1) ... [2024-11-13 15:58:00,946 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:00" (1/1) ... [2024-11-13 15:58:00,954 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:00" (1/1) ... [2024-11-13 15:58:00,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:00" (1/1) ... [2024-11-13 15:58:00,966 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:00" (1/1) ... [2024-11-13 15:58:00,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:58:00,975 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:58:00,979 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:58:00,979 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:58:00,981 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:00" (1/1) ... [2024-11-13 15:58:00,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:58:01,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:58:01,036 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:58:01,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:58:01,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:58:01,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 15:58:01,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 15:58:01,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:58:01,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:58:01,257 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:58:01,260 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:58:01,822 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-13 15:58:01,822 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:58:01,833 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:58:01,833 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:58:01,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:58:01 BoogieIcfgContainer [2024-11-13 15:58:01,834 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:58:01,837 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:58:01,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:58:01,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:58:01,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:58:00" (1/3) ... [2024-11-13 15:58:01,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b35baec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:58:01, skipping insertion in model container [2024-11-13 15:58:01,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:00" (2/3) ... [2024-11-13 15:58:01,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b35baec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:58:01, skipping insertion in model container [2024-11-13 15:58:01,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:58:01" (3/3) ... [2024-11-13 15:58:01,848 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b02.c [2024-11-13 15:58:01,869 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:58:01,872 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_b02.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:58:01,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:58:01,962 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;@1c193b63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:58:01,962 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:58:01,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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 15:58:01,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 15:58:01,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:58:01,974 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 15:58:01,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:58:01,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:58:01,979 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-13 15:58:01,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:58:01,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1923981937] [2024-11-13 15:58:01,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:58:01,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:58:01,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:58:01,998 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:58:02,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:58:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:02,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 15:58:02,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:58:02,617 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 15:58:02,619 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:58:02,620 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:58:02,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923981937] [2024-11-13 15:58:02,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923981937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:58:02,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:58:02,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:58:02,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398585052] [2024-11-13 15:58:02,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:58:02,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:58:02,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:58:02,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:58:02,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:58:02,663 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 15:58:02,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:58:02,747 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-13 15:58:02,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:58:02,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-11-13 15:58:02,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:58:02,759 INFO L225 Difference]: With dead ends: 18 [2024-11-13 15:58:02,759 INFO L226 Difference]: Without dead ends: 10 [2024-11-13 15:58:02,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 15:58:02,769 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:58:02,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:58:02,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-13 15:58:02,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-13 15:58:02,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 15:58:02,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-13 15:58:02,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-13 15:58:02,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:58:02,807 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-13 15:58:02,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 15:58:02,808 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-13 15:58:02,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 15:58:02,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:58:02,808 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-13 15:58:02,836 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 15:58:03,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:58:03,009 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:58:03,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:58:03,011 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-13 15:58:03,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:58:03,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1336692561] [2024-11-13 15:58:03,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:58:03,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:58:03,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:58:03,015 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:58:03,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:58:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:03,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-13 15:58:03,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:58:10,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:58:10,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:58:53,213 WARN L286 SmtUtils]: Spent 11.13s on a formula simplification. DAG size of input: 407 DAG size of output: 310 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:59:09,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:59:09,084 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:59:09,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336692561] [2024-11-13 15:59:09,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336692561] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:59:09,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:59:09,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-13 15:59:09,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24787971] [2024-11-13 15:59:09,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:59:09,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:59:09,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:59:09,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:59:09,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:59:09,087 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 15:59:09,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:59:09,267 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-13 15:59:09,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:59:09,268 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 8 [2024-11-13 15:59:09,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:59:09,268 INFO L225 Difference]: With dead ends: 15 [2024-11-13 15:59:09,268 INFO L226 Difference]: Without dead ends: 13 [2024-11-13 15:59:09,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:59:09,270 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:59:09,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 19 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:59:09,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-13 15:59:09,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-13 15:59:09,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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 15:59:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-13 15:59:09,274 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-13 15:59:09,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:59:09,274 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-13 15:59:09,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 15:59:09,275 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-13 15:59:09,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 15:59:09,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:59:09,275 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-13 15:59:09,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 15:59:09,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:59:09,476 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:59:09,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:59:09,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-13 15:59:09,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:59:09,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [439146963] [2024-11-13 15:59:09,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 15:59:09,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:59:09,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:59:09,491 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:59:09,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47133bb1-1113-4abf-9b5d-d7ef8d0d32c5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 15:59:09,683 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 15:59:09,683 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:59:09,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-13 15:59:09,695 INFO L278 TraceCheckSpWp]: Computing forward predicates...