./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1 --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 10b9451aec1c717f408158c024da4f049a32ac1e1eb7cd36cf3cd1261409bb31 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 10:10:12,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 10:10:12,696 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-12-02 10:10:12,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 10:10:12,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 10:10:12,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 10:10:12,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 10:10:12,725 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 10:10:12,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 10:10:12,725 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 10:10:12,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 10:10:12,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 10:10:12,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 10:10:12,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 10:10:12,726 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 10:10:12,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 10:10:12,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 10:10:12,726 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 10:10:12,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 10:10:12,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 10:10:12,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 10:10:12,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 10:10:12,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 10:10:12,727 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 10:10:12,727 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 10:10:12,727 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 10:10:12,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 10:10:12,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 10:10:12,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 10:10:12,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 10:10:12,728 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 10:10:12,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 10:10:12,728 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 10:10:12,728 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 10:10:12,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 10:10:12,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 10:10:12,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 10:10:12,728 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 10:10:12,728 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 10:10:12,728 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 10:10:12,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 10:10:12,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 10:10:12,729 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 10:10:12,729 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 10:10:12,729 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 10:10:12,729 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_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1 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 -> 10b9451aec1c717f408158c024da4f049a32ac1e1eb7cd36cf3cd1261409bb31 [2024-12-02 10:10:12,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 10:10:12,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 10:10:12,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 10:10:12,993 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 10:10:12,994 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 10:10:12,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c [2024-12-02 10:10:15,687 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/data/f28475844/f39c7f1a40a94f40aabbd42478d70709/FLAGb793cf749 [2024-12-02 10:10:15,934 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 10:10:15,935 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c [2024-12-02 10:10:15,946 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/data/f28475844/f39c7f1a40a94f40aabbd42478d70709/FLAGb793cf749 [2024-12-02 10:10:16,245 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/data/f28475844/f39c7f1a40a94f40aabbd42478d70709 [2024-12-02 10:10:16,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 10:10:16,248 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 10:10:16,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 10:10:16,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 10:10:16,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 10:10:16,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:10:16" (1/1) ... [2024-12-02 10:10:16,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@540ce7b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:16, skipping insertion in model container [2024-12-02 10:10:16,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:10:16" (1/1) ... [2024-12-02 10:10:16,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 10:10:16,386 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_b3dee77b-c690-421b-8d25-fd286152a97b/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c[1173,1186] [2024-12-02 10:10:16,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 10:10:16,506 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 10:10:16,513 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_b3dee77b-c690-421b-8d25-fd286152a97b/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c[1173,1186] [2024-12-02 10:10:16,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 10:10:16,596 INFO L204 MainTranslator]: Completed translation [2024-12-02 10:10:16,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:16 WrapperNode [2024-12-02 10:10:16,597 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 10:10:16,598 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 10:10:16,598 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 10:10:16,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 10:10:16,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:16" (1/1) ... [2024-12-02 10:10:16,620 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:16" (1/1) ... [2024-12-02 10:10:16,802 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1644 [2024-12-02 10:10:16,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 10:10:16,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 10:10:16,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 10:10:16,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 10:10:16,812 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:16" (1/1) ... [2024-12-02 10:10:16,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:16" (1/1) ... [2024-12-02 10:10:16,838 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:16" (1/1) ... [2024-12-02 10:10:16,896 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-12-02 10:10:16,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:16" (1/1) ... [2024-12-02 10:10:16,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:16" (1/1) ... [2024-12-02 10:10:16,945 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:16" (1/1) ... [2024-12-02 10:10:16,949 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:16" (1/1) ... [2024-12-02 10:10:16,960 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:16" (1/1) ... [2024-12-02 10:10:16,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:16" (1/1) ... [2024-12-02 10:10:16,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:16" (1/1) ... [2024-12-02 10:10:17,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 10:10:17,015 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 10:10:17,015 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 10:10:17,015 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 10:10:17,016 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:16" (1/1) ... [2024-12-02 10:10:17,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 10:10:17,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:10:17,046 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 10:10:17,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 10:10:17,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 10:10:17,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 10:10:17,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 10:10:17,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 10:10:17,221 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 10:10:17,223 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 10:10:19,266 INFO L? ?]: Removed 857 outVars from TransFormulas that were not future-live. [2024-12-02 10:10:19,267 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 10:10:19,289 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 10:10:19,289 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-02 10:10:19,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:10:19 BoogieIcfgContainer [2024-12-02 10:10:19,290 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 10:10:19,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 10:10:19,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 10:10:19,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 10:10:19,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 10:10:16" (1/3) ... [2024-12-02 10:10:19,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2847117d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:10:19, skipping insertion in model container [2024-12-02 10:10:19,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:16" (2/3) ... [2024-12-02 10:10:19,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2847117d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:10:19, skipping insertion in model container [2024-12-02 10:10:19,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:10:19" (3/3) ... [2024-12-02 10:10:19,300 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.1.prop1-func-interl.c [2024-12-02 10:10:19,316 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 10:10:19,318 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.adding.1.prop1-func-interl.c that has 1 procedures, 597 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-12-02 10:10:19,385 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 10:10:19,397 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;@38e1adfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 10:10:19,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 10:10:19,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 597 states, 595 states have (on average 1.5025210084033613) internal successors, (894), 596 states have internal predecessors, (894), 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-12-02 10:10:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-12-02 10:10:19,411 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:10:19,411 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:10:19,412 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:10:19,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:10:19,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1368434867, now seen corresponding path program 1 times [2024-12-02 10:10:19,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:10:19,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352359813] [2024-12-02 10:10:19,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:10:19,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:10:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:10:19,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:10:19,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:10:19,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352359813] [2024-12-02 10:10:19,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352359813] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:10:19,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:10:19,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 10:10:19,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725834015] [2024-12-02 10:10:19,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:10:19,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:10:19,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:10:19,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:10:19,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:10:19,966 INFO L87 Difference]: Start difference. First operand has 597 states, 595 states have (on average 1.5025210084033613) internal successors, (894), 596 states have internal predecessors, (894), 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 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-12-02 10:10:20,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:10:20,063 INFO L93 Difference]: Finished difference Result 1149 states and 1724 transitions. [2024-12-02 10:10:20,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 10:10:20,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2024-12-02 10:10:20,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:10:20,076 INFO L225 Difference]: With dead ends: 1149 [2024-12-02 10:10:20,077 INFO L226 Difference]: Without dead ends: 594 [2024-12-02 10:10:20,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:10:20,083 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 858 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:10:20,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 1762 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:10:20,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2024-12-02 10:10:20,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2024-12-02 10:10:20,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 593 states have (on average 1.4991568296795952) internal successors, (889), 593 states have internal predecessors, (889), 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-12-02 10:10:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 889 transitions. [2024-12-02 10:10:20,130 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 889 transitions. Word has length 59 [2024-12-02 10:10:20,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:10:20,130 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 889 transitions. [2024-12-02 10:10:20,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-12-02 10:10:20,131 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 889 transitions. [2024-12-02 10:10:20,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-12-02 10:10:20,133 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:10:20,133 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:10:20,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 10:10:20,133 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:10:20,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:10:20,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1453492137, now seen corresponding path program 1 times [2024-12-02 10:10:20,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:10:20,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086540983] [2024-12-02 10:10:20,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:10:20,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:10:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:10:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:10:20,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:10:20,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086540983] [2024-12-02 10:10:20,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086540983] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:10:20,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:10:20,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 10:10:20,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502256446] [2024-12-02 10:10:20,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:10:20,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:10:20,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:10:20,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:10:20,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:10:20,376 INFO L87 Difference]: Start difference. First operand 594 states and 889 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-12-02 10:10:20,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:10:20,410 INFO L93 Difference]: Finished difference Result 598 states and 893 transitions. [2024-12-02 10:10:20,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 10:10:20,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2024-12-02 10:10:20,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:10:20,413 INFO L225 Difference]: With dead ends: 598 [2024-12-02 10:10:20,414 INFO L226 Difference]: Without dead ends: 596 [2024-12-02 10:10:20,414 INFO L434 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-12-02 10:10:20,415 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 0 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2655 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-12-02 10:10:20,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2655 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:10:20,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-12-02 10:10:20,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2024-12-02 10:10:20,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 595 states have (on average 1.4974789915966387) internal successors, (891), 595 states have internal predecessors, (891), 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-12-02 10:10:20,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 891 transitions. [2024-12-02 10:10:20,433 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 891 transitions. Word has length 60 [2024-12-02 10:10:20,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:10:20,433 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 891 transitions. [2024-12-02 10:10:20,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-12-02 10:10:20,434 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 891 transitions. [2024-12-02 10:10:20,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-12-02 10:10:20,435 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:10:20,435 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:10:20,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 10:10:20,436 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:10:20,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:10:20,436 INFO L85 PathProgramCache]: Analyzing trace with hash 2110278823, now seen corresponding path program 1 times [2024-12-02 10:10:20,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:10:20,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174319134] [2024-12-02 10:10:20,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:10:20,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:10:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:10:20,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:10:20,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:10:20,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174319134] [2024-12-02 10:10:20,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174319134] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:10:20,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:10:20,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 10:10:20,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663378496] [2024-12-02 10:10:20,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:10:20,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:10:20,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:10:20,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:10:20,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:10:20,583 INFO L87 Difference]: Start difference. First operand 596 states and 891 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-12-02 10:10:20,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:10:20,623 INFO L93 Difference]: Finished difference Result 1152 states and 1723 transitions. [2024-12-02 10:10:20,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 10:10:20,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2024-12-02 10:10:20,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:10:20,626 INFO L225 Difference]: With dead ends: 1152 [2024-12-02 10:10:20,627 INFO L226 Difference]: Without dead ends: 598 [2024-12-02 10:10:20,627 INFO L434 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-12-02 10:10:20,628 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 0 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2651 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.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:10:20,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2651 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:10:20,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-12-02 10:10:20,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2024-12-02 10:10:20,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.4958123953098827) internal successors, (893), 597 states have internal predecessors, (893), 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-12-02 10:10:20,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 893 transitions. [2024-12-02 10:10:20,639 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 893 transitions. Word has length 61 [2024-12-02 10:10:20,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:10:20,639 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 893 transitions. [2024-12-02 10:10:20,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-12-02 10:10:20,639 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 893 transitions. [2024-12-02 10:10:20,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-12-02 10:10:20,641 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:10:20,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:10:20,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 10:10:20,641 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:10:20,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:10:20,642 INFO L85 PathProgramCache]: Analyzing trace with hash -103831486, now seen corresponding path program 1 times [2024-12-02 10:10:20,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:10:20,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531158298] [2024-12-02 10:10:20,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:10:20,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:10:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:10:20,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:10:20,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:10:20,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531158298] [2024-12-02 10:10:20,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531158298] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:10:20,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:10:20,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 10:10:20,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364480344] [2024-12-02 10:10:20,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:10:20,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:10:20,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:10:20,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:10:20,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:10:20,778 INFO L87 Difference]: Start difference. First operand 598 states and 893 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-12-02 10:10:20,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:10:20,830 INFO L93 Difference]: Finished difference Result 1156 states and 1727 transitions. [2024-12-02 10:10:20,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 10:10:20,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2024-12-02 10:10:20,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:10:20,832 INFO L225 Difference]: With dead ends: 1156 [2024-12-02 10:10:20,832 INFO L226 Difference]: Without dead ends: 600 [2024-12-02 10:10:20,833 INFO L434 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-12-02 10:10:20,833 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 0 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2645 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:10:20,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2645 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:10:20,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-12-02 10:10:20,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2024-12-02 10:10:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.4941569282136895) internal successors, (895), 599 states have internal predecessors, (895), 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-12-02 10:10:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 895 transitions. [2024-12-02 10:10:20,847 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 895 transitions. Word has length 62 [2024-12-02 10:10:20,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:10:20,847 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 895 transitions. [2024-12-02 10:10:20,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-12-02 10:10:20,848 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 895 transitions. [2024-12-02 10:10:20,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-02 10:10:20,849 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:10:20,849 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:10:20,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 10:10:20,849 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:10:20,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:10:20,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1985078414, now seen corresponding path program 1 times [2024-12-02 10:10:20,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:10:20,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369968874] [2024-12-02 10:10:20,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:10:20,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:10:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:10:21,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:10:21,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:10:21,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369968874] [2024-12-02 10:10:21,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369968874] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:10:21,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:10:21,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 10:10:21,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740573645] [2024-12-02 10:10:21,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:10:21,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 10:10:21,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:10:21,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 10:10:21,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:10:21,098 INFO L87 Difference]: Start difference. First operand 600 states and 895 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-12-02 10:10:21,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:10:21,158 INFO L93 Difference]: Finished difference Result 1162 states and 1734 transitions. [2024-12-02 10:10:21,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:10:21,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 63 [2024-12-02 10:10:21,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:10:21,161 INFO L225 Difference]: With dead ends: 1162 [2024-12-02 10:10:21,161 INFO L226 Difference]: Without dead ends: 604 [2024-12-02 10:10:21,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:10:21,162 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 4 mSDsluCounter, 2634 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3515 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:10:21,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3515 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:10:21,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-12-02 10:10:21,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 602. [2024-12-02 10:10:21,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 601 states have (on average 1.4925124792013311) internal successors, (897), 601 states have internal predecessors, (897), 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-12-02 10:10:21,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 897 transitions. [2024-12-02 10:10:21,177 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 897 transitions. Word has length 63 [2024-12-02 10:10:21,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:10:21,178 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 897 transitions. [2024-12-02 10:10:21,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-12-02 10:10:21,178 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 897 transitions. [2024-12-02 10:10:21,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 10:10:21,179 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:10:21,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:10:21,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 10:10:21,179 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:10:21,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:10:21,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1793926481, now seen corresponding path program 1 times [2024-12-02 10:10:21,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:10:21,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196324968] [2024-12-02 10:10:21,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:10:21,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:10:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:10:21,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:10:21,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:10:21,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196324968] [2024-12-02 10:10:21,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196324968] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:10:21,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:10:21,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 10:10:21,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521124857] [2024-12-02 10:10:21,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:10:21,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 10:10:21,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:10:21,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 10:10:21,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:10:21,386 INFO L87 Difference]: Start difference. First operand 602 states and 897 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-12-02 10:10:21,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:10:21,431 INFO L93 Difference]: Finished difference Result 1189 states and 1772 transitions. [2024-12-02 10:10:21,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:10:21,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 64 [2024-12-02 10:10:21,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:10:21,434 INFO L225 Difference]: With dead ends: 1189 [2024-12-02 10:10:21,434 INFO L226 Difference]: Without dead ends: 629 [2024-12-02 10:10:21,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:10:21,436 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 64 mSDsluCounter, 2590 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 3476 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-12-02 10:10:21,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 3476 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:10:21,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-12-02 10:10:21,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2024-12-02 10:10:21,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 628 states have (on average 1.4904458598726114) internal successors, (936), 628 states have internal predecessors, (936), 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-12-02 10:10:21,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 936 transitions. [2024-12-02 10:10:21,451 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 936 transitions. Word has length 64 [2024-12-02 10:10:21,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:10:21,452 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 936 transitions. [2024-12-02 10:10:21,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-12-02 10:10:21,452 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 936 transitions. [2024-12-02 10:10:21,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 10:10:21,452 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:10:21,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:10:21,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 10:10:21,453 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:10:21,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:10:21,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1882603606, now seen corresponding path program 1 times [2024-12-02 10:10:21,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:10:21,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283787195] [2024-12-02 10:10:21,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:10:21,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:10:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:10:21,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:10:21,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:10:21,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283787195] [2024-12-02 10:10:21,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283787195] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:10:21,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:10:21,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 10:10:21,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902123849] [2024-12-02 10:10:21,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:10:21,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 10:10:21,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:10:21,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 10:10:21,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:10:21,826 INFO L87 Difference]: Start difference. First operand 629 states and 936 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-12-02 10:10:22,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:10:22,032 INFO L93 Difference]: Finished difference Result 1196 states and 1785 transitions. [2024-12-02 10:10:22,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 10:10:22,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 64 [2024-12-02 10:10:22,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:10:22,035 INFO L225 Difference]: With dead ends: 1196 [2024-12-02 10:10:22,035 INFO L226 Difference]: Without dead ends: 636 [2024-12-02 10:10:22,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-12-02 10:10:22,037 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 863 mSDsluCounter, 2499 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 3339 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 10:10:22,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 3339 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 10:10:22,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-12-02 10:10:22,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 633. [2024-12-02 10:10:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.4873417721518987) internal successors, (940), 632 states have internal predecessors, (940), 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-12-02 10:10:22,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 940 transitions. [2024-12-02 10:10:22,054 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 940 transitions. Word has length 64 [2024-12-02 10:10:22,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:10:22,055 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 940 transitions. [2024-12-02 10:10:22,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-12-02 10:10:22,055 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 940 transitions. [2024-12-02 10:10:22,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-02 10:10:22,055 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:10:22,056 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:10:22,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 10:10:22,056 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:10:22,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:10:22,056 INFO L85 PathProgramCache]: Analyzing trace with hash -353009811, now seen corresponding path program 1 times [2024-12-02 10:10:22,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:10:22,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686715913] [2024-12-02 10:10:22,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:10:22,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:10:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:10:22,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:10:22,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:10:22,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686715913] [2024-12-02 10:10:22,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686715913] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:10:22,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:10:22,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 10:10:22,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642822203] [2024-12-02 10:10:22,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:10:22,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:10:22,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:10:22,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:10:22,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:10:22,249 INFO L87 Difference]: Start difference. First operand 633 states and 940 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-12-02 10:10:22,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:10:22,362 INFO L93 Difference]: Finished difference Result 1203 states and 1789 transitions. [2024-12-02 10:10:22,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 10:10:22,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2024-12-02 10:10:22,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:10:22,365 INFO L225 Difference]: With dead ends: 1203 [2024-12-02 10:10:22,365 INFO L226 Difference]: Without dead ends: 636 [2024-12-02 10:10:22,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:10:22,366 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 847 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 10:10:22,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 1690 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 10:10:22,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-12-02 10:10:22,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2024-12-02 10:10:22,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 1.48503937007874) internal successors, (943), 635 states have internal predecessors, (943), 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-12-02 10:10:22,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 943 transitions. [2024-12-02 10:10:22,383 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 943 transitions. Word has length 65 [2024-12-02 10:10:22,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:10:22,383 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 943 transitions. [2024-12-02 10:10:22,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-12-02 10:10:22,383 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 943 transitions. [2024-12-02 10:10:22,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-02 10:10:22,384 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:10:22,384 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:10:22,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 10:10:22,384 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:10:22,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:10:22,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1064191121, now seen corresponding path program 1 times [2024-12-02 10:10:22,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:10:22,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44349503] [2024-12-02 10:10:22,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:10:22,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:10:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:10:22,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:10:22,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:10:22,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44349503] [2024-12-02 10:10:22,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44349503] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:10:22,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:10:22,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 10:10:22,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178173159] [2024-12-02 10:10:22,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:10:22,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:10:22,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:10:22,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:10:22,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:10:22,558 INFO L87 Difference]: Start difference. First operand 636 states and 943 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-12-02 10:10:22,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:10:22,605 INFO L93 Difference]: Finished difference Result 1202 states and 1784 transitions. [2024-12-02 10:10:22,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 10:10:22,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2024-12-02 10:10:22,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:10:22,609 INFO L225 Difference]: With dead ends: 1202 [2024-12-02 10:10:22,609 INFO L226 Difference]: Without dead ends: 635 [2024-12-02 10:10:22,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:10:22,610 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 844 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1749 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:10:22,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1749 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:10:22,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-12-02 10:10:22,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2024-12-02 10:10:22,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 1.4842271293375395) internal successors, (941), 634 states have internal predecessors, (941), 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-12-02 10:10:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 941 transitions. [2024-12-02 10:10:22,628 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 941 transitions. Word has length 65 [2024-12-02 10:10:22,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:10:22,628 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 941 transitions. [2024-12-02 10:10:22,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-12-02 10:10:22,628 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 941 transitions. [2024-12-02 10:10:22,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-12-02 10:10:22,629 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:10:22,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:10:22,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 10:10:22,629 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:10:22,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:10:22,630 INFO L85 PathProgramCache]: Analyzing trace with hash 348639918, now seen corresponding path program 1 times [2024-12-02 10:10:22,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:10:22,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219158006] [2024-12-02 10:10:22,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:10:22,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:10:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:10:22,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:10:22,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:10:22,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219158006] [2024-12-02 10:10:22,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219158006] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:10:22,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:10:22,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 10:10:22,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831217811] [2024-12-02 10:10:22,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:10:22,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 10:10:22,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:10:22,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 10:10:22,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:10:22,900 INFO L87 Difference]: Start difference. First operand 635 states and 941 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-12-02 10:10:23,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:10:23,014 INFO L93 Difference]: Finished difference Result 1205 states and 1787 transitions. [2024-12-02 10:10:23,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 10:10:23,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 66 [2024-12-02 10:10:23,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:10:23,016 INFO L225 Difference]: With dead ends: 1205 [2024-12-02 10:10:23,016 INFO L226 Difference]: Without dead ends: 639 [2024-12-02 10:10:23,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-12-02 10:10:23,017 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 9 mSDsluCounter, 3437 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4305 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 10:10:23,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4305 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 10:10:23,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-12-02 10:10:23,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 636. [2024-12-02 10:10:23,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 1.4834645669291338) internal successors, (942), 635 states have internal predecessors, (942), 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-12-02 10:10:23,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 942 transitions. [2024-12-02 10:10:23,028 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 942 transitions. Word has length 66 [2024-12-02 10:10:23,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:10:23,028 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 942 transitions. [2024-12-02 10:10:23,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-12-02 10:10:23,028 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 942 transitions. [2024-12-02 10:10:23,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-12-02 10:10:23,029 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:10:23,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:10:23,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 10:10:23,029 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:10:23,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:10:23,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1969752466, now seen corresponding path program 1 times [2024-12-02 10:10:23,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:10:23,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508890965] [2024-12-02 10:10:23,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:10:23,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:10:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:10:23,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:10:23,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:10:23,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508890965] [2024-12-02 10:10:23,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508890965] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:10:23,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:10:23,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 10:10:23,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487246936] [2024-12-02 10:10:23,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:10:23,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 10:10:23,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:10:23,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 10:10:23,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-12-02 10:10:23,485 INFO L87 Difference]: Start difference. First operand 636 states and 942 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 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-12-02 10:10:23,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:10:23,731 INFO L93 Difference]: Finished difference Result 1214 states and 1798 transitions. [2024-12-02 10:10:23,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 10:10:23,731 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 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 66 [2024-12-02 10:10:23,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:10:23,733 INFO L225 Difference]: With dead ends: 1214 [2024-12-02 10:10:23,733 INFO L226 Difference]: Without dead ends: 647 [2024-12-02 10:10:23,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-12-02 10:10:23,734 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 870 mSDsluCounter, 5084 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 5943 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 10:10:23,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 5943 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 10:10:23,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-12-02 10:10:23,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 643. [2024-12-02 10:10:23,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 642 states have (on average 1.4781931464174456) internal successors, (949), 642 states have internal predecessors, (949), 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-12-02 10:10:23,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 949 transitions. [2024-12-02 10:10:23,747 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 949 transitions. Word has length 66 [2024-12-02 10:10:23,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:10:23,747 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 949 transitions. [2024-12-02 10:10:23,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 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-12-02 10:10:23,747 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 949 transitions. [2024-12-02 10:10:23,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-12-02 10:10:23,747 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:10:23,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:10:23,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 10:10:23,748 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:10:23,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:10:23,748 INFO L85 PathProgramCache]: Analyzing trace with hash 423924778, now seen corresponding path program 1 times [2024-12-02 10:10:23,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:10:23,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280879773] [2024-12-02 10:10:23,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:10:23,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:10:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:10:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:10:24,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:10:24,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280879773] [2024-12-02 10:10:24,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280879773] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:10:24,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:10:24,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 10:10:24,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37131162] [2024-12-02 10:10:24,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:10:24,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 10:10:24,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:10:24,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 10:10:24,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-12-02 10:10:24,168 INFO L87 Difference]: Start difference. First operand 643 states and 949 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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-12-02 10:10:24,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:10:24,429 INFO L93 Difference]: Finished difference Result 1227 states and 1811 transitions. [2024-12-02 10:10:24,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 10:10:24,429 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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 67 [2024-12-02 10:10:24,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:10:24,431 INFO L225 Difference]: With dead ends: 1227 [2024-12-02 10:10:24,431 INFO L226 Difference]: Without dead ends: 653 [2024-12-02 10:10:24,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-12-02 10:10:24,432 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 870 mSDsluCounter, 5102 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 5968 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 10:10:24,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 5968 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 10:10:24,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-12-02 10:10:24,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 645. [2024-12-02 10:10:24,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.4782608695652173) internal successors, (952), 644 states have internal predecessors, (952), 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-12-02 10:10:24,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 952 transitions. [2024-12-02 10:10:24,442 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 952 transitions. Word has length 67 [2024-12-02 10:10:24,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:10:24,442 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 952 transitions. [2024-12-02 10:10:24,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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-12-02 10:10:24,442 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 952 transitions. [2024-12-02 10:10:24,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-12-02 10:10:24,442 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:10:24,442 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:10:24,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 10:10:24,443 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:10:24,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:10:24,443 INFO L85 PathProgramCache]: Analyzing trace with hash 565617738, now seen corresponding path program 1 times [2024-12-02 10:10:24,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:10:24,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754680509] [2024-12-02 10:10:24,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:10:24,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:10:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:10:24,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:10:24,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:10:24,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754680509] [2024-12-02 10:10:24,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754680509] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:10:24,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:10:24,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 10:10:24,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255720073] [2024-12-02 10:10:24,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:10:24,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 10:10:24,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:10:24,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 10:10:24,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-12-02 10:10:24,686 INFO L87 Difference]: Start difference. First operand 645 states and 952 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-12-02 10:10:24,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:10:24,836 INFO L93 Difference]: Finished difference Result 1230 states and 1814 transitions. [2024-12-02 10:10:24,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 10:10:24,836 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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 68 [2024-12-02 10:10:24,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:10:24,838 INFO L225 Difference]: With dead ends: 1230 [2024-12-02 10:10:24,838 INFO L226 Difference]: Without dead ends: 654 [2024-12-02 10:10:24,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-12-02 10:10:24,839 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 6 mSDsluCounter, 5138 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5998 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 10:10:24,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5998 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 10:10:24,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2024-12-02 10:10:24,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 652. [2024-12-02 10:10:24,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 651 states have (on average 1.4746543778801844) internal successors, (960), 651 states have internal predecessors, (960), 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-12-02 10:10:24,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 960 transitions. [2024-12-02 10:10:24,852 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 960 transitions. Word has length 68 [2024-12-02 10:10:24,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:10:24,852 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 960 transitions. [2024-12-02 10:10:24,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-12-02 10:10:24,852 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 960 transitions. [2024-12-02 10:10:24,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-12-02 10:10:24,852 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:10:24,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:10:24,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 10:10:24,853 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:10:24,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:10:24,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1988327780, now seen corresponding path program 1 times [2024-12-02 10:10:24,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:10:24,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128395836] [2024-12-02 10:10:24,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:10:24,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:10:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:10:25,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:10:25,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:10:25,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128395836] [2024-12-02 10:10:25,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128395836] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:10:25,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:10:25,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 10:10:25,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859423844] [2024-12-02 10:10:25,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:10:25,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 10:10:25,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:10:25,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 10:10:25,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:10:25,031 INFO L87 Difference]: Start difference. First operand 652 states and 960 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-12-02 10:10:25,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:10:25,874 INFO L93 Difference]: Finished difference Result 1760 states and 2592 transitions. [2024-12-02 10:10:25,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:10:25,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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 68 [2024-12-02 10:10:25,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:10:25,879 INFO L225 Difference]: With dead ends: 1760 [2024-12-02 10:10:25,880 INFO L226 Difference]: Without dead ends: 1177 [2024-12-02 10:10:25,881 INFO L434 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-12-02 10:10:25,881 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 797 mSDsluCounter, 1909 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 2569 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-12-02 10:10:25,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 2569 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-12-02 10:10:25,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2024-12-02 10:10:25,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 702. [2024-12-02 10:10:25,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 701 states have (on average 1.4593437945791725) internal successors, (1023), 701 states have internal predecessors, (1023), 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-12-02 10:10:25,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1023 transitions. [2024-12-02 10:10:25,909 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1023 transitions. Word has length 68 [2024-12-02 10:10:25,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:10:25,909 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1023 transitions. [2024-12-02 10:10:25,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-12-02 10:10:25,909 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1023 transitions. [2024-12-02 10:10:25,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-12-02 10:10:25,910 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:10:25,910 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:10:25,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 10:10:25,910 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:10:25,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:10:25,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1189272367, now seen corresponding path program 1 times [2024-12-02 10:10:25,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:10:25,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308292108] [2024-12-02 10:10:25,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:10:25,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:10:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:10:26,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:10:26,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:10:26,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308292108] [2024-12-02 10:10:26,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308292108] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:10:26,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:10:26,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 10:10:26,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208869055] [2024-12-02 10:10:26,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:10:26,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 10:10:26,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:10:26,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 10:10:26,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-12-02 10:10:26,320 INFO L87 Difference]: Start difference. First operand 702 states and 1023 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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-12-02 10:10:26,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:10:26,424 INFO L93 Difference]: Finished difference Result 1296 states and 1896 transitions. [2024-12-02 10:10:26,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 10:10:26,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 69 [2024-12-02 10:10:26,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:10:26,427 INFO L225 Difference]: With dead ends: 1296 [2024-12-02 10:10:26,427 INFO L226 Difference]: Without dead ends: 713 [2024-12-02 10:10:26,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-12-02 10:10:26,429 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 835 mSDsluCounter, 3484 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 4362 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:10:26,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 4362 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:10:26,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2024-12-02 10:10:26,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 709. [2024-12-02 10:10:26,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 708 states have (on average 1.4576271186440677) internal successors, (1032), 708 states have internal predecessors, (1032), 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-12-02 10:10:26,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1032 transitions. [2024-12-02 10:10:26,447 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1032 transitions. Word has length 69 [2024-12-02 10:10:26,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:10:26,447 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 1032 transitions. [2024-12-02 10:10:26,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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-12-02 10:10:26,447 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1032 transitions. [2024-12-02 10:10:26,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-12-02 10:10:26,448 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:10:26,448 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:10:26,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 10:10:26,448 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:10:26,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:10:26,449 INFO L85 PathProgramCache]: Analyzing trace with hash 977059328, now seen corresponding path program 1 times [2024-12-02 10:10:26,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:10:26,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933518494] [2024-12-02 10:10:26,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:10:26,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:10:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:10:26,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:10:26,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:10:26,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933518494] [2024-12-02 10:10:26,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933518494] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:10:26,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:10:26,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 10:10:26,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407265967] [2024-12-02 10:10:26,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:10:26,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 10:10:26,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:10:26,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 10:10:26,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-12-02 10:10:26,825 INFO L87 Difference]: Start difference. First operand 709 states and 1032 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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-12-02 10:10:27,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:10:27,182 INFO L93 Difference]: Finished difference Result 1331 states and 1949 transitions. [2024-12-02 10:10:27,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 10:10:27,183 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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 70 [2024-12-02 10:10:27,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:10:27,186 INFO L225 Difference]: With dead ends: 1331 [2024-12-02 10:10:27,186 INFO L226 Difference]: Without dead ends: 725 [2024-12-02 10:10:27,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-12-02 10:10:27,187 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 845 mSDsluCounter, 4130 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 4965 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 10:10:27,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 4965 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 10:10:27,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-12-02 10:10:27,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2024-12-02 10:10:27,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 1.4530386740331491) internal successors, (1052), 724 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:10:27,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1052 transitions. [2024-12-02 10:10:27,205 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1052 transitions. Word has length 70 [2024-12-02 10:10:27,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:10:27,205 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1052 transitions. [2024-12-02 10:10:27,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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-12-02 10:10:27,205 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1052 transitions. [2024-12-02 10:10:27,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-02 10:10:27,206 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:10:27,206 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:10:27,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 10:10:27,207 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:10:27,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:10:27,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1977496067, now seen corresponding path program 1 times [2024-12-02 10:10:27,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:10:27,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267037307] [2024-12-02 10:10:27,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:10:27,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:10:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:10:27,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:10:27,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:10:27,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267037307] [2024-12-02 10:10:27,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267037307] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:10:27,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:10:27,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 10:10:27,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494201315] [2024-12-02 10:10:27,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:10:27,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 10:10:27,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:10:27,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 10:10:27,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-12-02 10:10:27,478 INFO L87 Difference]: Start difference. First operand 725 states and 1052 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-12-02 10:10:27,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:10:27,781 INFO L93 Difference]: Finished difference Result 1359 states and 1976 transitions. [2024-12-02 10:10:27,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 10:10:27,782 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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 71 [2024-12-02 10:10:27,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:10:27,784 INFO L225 Difference]: With dead ends: 1359 [2024-12-02 10:10:27,784 INFO L226 Difference]: Without dead ends: 735 [2024-12-02 10:10:27,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-12-02 10:10:27,786 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 873 mSDsluCounter, 4146 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 4978 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 10:10:27,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 4978 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 10:10:27,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-12-02 10:10:27,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 728. [2024-12-02 10:10:27,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 727 states have (on average 1.4497936726272351) internal successors, (1054), 727 states have internal predecessors, (1054), 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-12-02 10:10:27,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1054 transitions. [2024-12-02 10:10:27,803 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1054 transitions. Word has length 71 [2024-12-02 10:10:27,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:10:27,803 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 1054 transitions. [2024-12-02 10:10:27,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-12-02 10:10:27,804 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1054 transitions. [2024-12-02 10:10:27,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-02 10:10:27,804 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:10:27,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:10:27,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 10:10:27,805 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:10:27,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:10:27,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1277851670, now seen corresponding path program 1 times [2024-12-02 10:10:27,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:10:27,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273510583] [2024-12-02 10:10:27,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:10:27,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:10:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:10:28,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:10:28,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:10:28,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273510583] [2024-12-02 10:10:28,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273510583] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:10:28,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:10:28,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 10:10:28,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281562449] [2024-12-02 10:10:28,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:10:28,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 10:10:28,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:10:28,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 10:10:28,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-12-02 10:10:28,035 INFO L87 Difference]: Start difference. First operand 728 states and 1054 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-12-02 10:10:28,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:10:28,179 INFO L93 Difference]: Finished difference Result 1344 states and 1956 transitions. [2024-12-02 10:10:28,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 10:10:28,179 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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 71 [2024-12-02 10:10:28,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:10:28,182 INFO L225 Difference]: With dead ends: 1344 [2024-12-02 10:10:28,182 INFO L226 Difference]: Without dead ends: 735 [2024-12-02 10:10:28,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-12-02 10:10:28,183 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 5 mSDsluCounter, 5148 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6010 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 10:10:28,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6010 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 10:10:28,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-12-02 10:10:28,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 718. [2024-12-02 10:10:28,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 1.4560669456066946) internal successors, (1044), 717 states have internal predecessors, (1044), 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-12-02 10:10:28,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1044 transitions. [2024-12-02 10:10:28,200 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1044 transitions. Word has length 71 [2024-12-02 10:10:28,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:10:28,201 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1044 transitions. [2024-12-02 10:10:28,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-12-02 10:10:28,201 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1044 transitions. [2024-12-02 10:10:28,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-02 10:10:28,201 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:10:28,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:10:28,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 10:10:28,202 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:10:28,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:10:28,202 INFO L85 PathProgramCache]: Analyzing trace with hash -668387598, now seen corresponding path program 1 times [2024-12-02 10:10:28,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:10:28,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179385208] [2024-12-02 10:10:28,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:10:28,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:10:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:10:28,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:10:28,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:10:28,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179385208] [2024-12-02 10:10:28,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179385208] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:10:28,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:10:28,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 10:10:28,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7575984] [2024-12-02 10:10:28,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:10:28,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 10:10:28,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:10:28,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 10:10:28,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 10:10:28,524 INFO L87 Difference]: Start difference. First operand 718 states and 1044 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-12-02 10:10:28,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:10:28,761 INFO L93 Difference]: Finished difference Result 1323 states and 1932 transitions. [2024-12-02 10:10:28,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 10:10:28,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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 71 [2024-12-02 10:10:28,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:10:28,764 INFO L225 Difference]: With dead ends: 1323 [2024-12-02 10:10:28,764 INFO L226 Difference]: Without dead ends: 729 [2024-12-02 10:10:28,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-12-02 10:10:28,765 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 826 mSDsluCounter, 3356 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 4206 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 10:10:28,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 4206 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 10:10:28,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2024-12-02 10:10:28,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 718. [2024-12-02 10:10:28,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 1.4560669456066946) internal successors, (1044), 717 states have internal predecessors, (1044), 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-12-02 10:10:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1044 transitions. [2024-12-02 10:10:28,782 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1044 transitions. Word has length 71 [2024-12-02 10:10:28,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:10:28,782 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1044 transitions. [2024-12-02 10:10:28,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-12-02 10:10:28,782 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1044 transitions. [2024-12-02 10:10:28,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-12-02 10:10:28,783 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:10:28,783 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:10:28,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-02 10:10:28,783 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:10:28,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:10:28,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1572057892, now seen corresponding path program 1 times [2024-12-02 10:10:28,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:10:28,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546048295] [2024-12-02 10:10:28,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:10:28,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:10:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:10:28,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:10:28,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:10:28,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546048295] [2024-12-02 10:10:28,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546048295] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:10:28,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:10:28,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 10:10:28,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298990760] [2024-12-02 10:10:28,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:10:28,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:10:28,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:10:28,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:10:28,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:10:28,945 INFO L87 Difference]: Start difference. First operand 718 states and 1044 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-12-02 10:10:29,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:10:29,035 INFO L93 Difference]: Finished difference Result 1329 states and 1941 transitions. [2024-12-02 10:10:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 10:10:29,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 72 [2024-12-02 10:10:29,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:10:29,038 INFO L225 Difference]: With dead ends: 1329 [2024-12-02 10:10:29,038 INFO L226 Difference]: Without dead ends: 718 [2024-12-02 10:10:29,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:10:29,039 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 879 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 10:10:29,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 1680 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 10:10:29,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-12-02 10:10:29,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2024-12-02 10:10:29,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 1.4532775453277544) internal successors, (1042), 717 states have internal predecessors, (1042), 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-12-02 10:10:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1042 transitions. [2024-12-02 10:10:29,057 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1042 transitions. Word has length 72 [2024-12-02 10:10:29,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:10:29,057 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1042 transitions. [2024-12-02 10:10:29,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-12-02 10:10:29,057 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1042 transitions. [2024-12-02 10:10:29,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-12-02 10:10:29,058 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:10:29,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:10:29,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 10:10:29,058 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:10:29,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:10:29,059 INFO L85 PathProgramCache]: Analyzing trace with hash 410843117, now seen corresponding path program 1 times [2024-12-02 10:10:29,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:10:29,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600357253] [2024-12-02 10:10:29,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:10:29,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:10:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:10:29,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:10:29,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:10:29,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600357253] [2024-12-02 10:10:29,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600357253] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:10:29,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:10:29,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 10:10:29,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010664772] [2024-12-02 10:10:29,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:10:29,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 10:10:29,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:10:29,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 10:10:29,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-12-02 10:10:29,354 INFO L87 Difference]: Start difference. First operand 718 states and 1042 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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-12-02 10:10:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:10:29,529 INFO L93 Difference]: Finished difference Result 1336 states and 1946 transitions. [2024-12-02 10:10:29,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:10:29,529 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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 73 [2024-12-02 10:10:29,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:10:29,532 INFO L225 Difference]: With dead ends: 1336 [2024-12-02 10:10:29,532 INFO L226 Difference]: Without dead ends: 716 [2024-12-02 10:10:29,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-12-02 10:10:29,534 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 1693 mSDsluCounter, 2492 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1693 SdHoareTripleChecker+Valid, 3332 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 10:10:29,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1693 Valid, 3332 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 10:10:29,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2024-12-02 10:10:29,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 715. [2024-12-02 10:10:29,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.4509803921568627) internal successors, (1036), 714 states have internal predecessors, (1036), 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-12-02 10:10:29,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1036 transitions. [2024-12-02 10:10:29,552 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1036 transitions. Word has length 73 [2024-12-02 10:10:29,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:10:29,552 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1036 transitions. [2024-12-02 10:10:29,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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-12-02 10:10:29,552 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1036 transitions. [2024-12-02 10:10:29,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-12-02 10:10:29,553 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:10:29,553 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:10:29,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 10:10:29,553 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:10:29,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:10:29,554 INFO L85 PathProgramCache]: Analyzing trace with hash 228712370, now seen corresponding path program 1 times [2024-12-02 10:10:29,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:10:29,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260105283] [2024-12-02 10:10:29,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:10:29,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:10:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:10:29,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:10:29,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:10:29,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260105283] [2024-12-02 10:10:29,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260105283] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:10:29,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:10:29,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 10:10:29,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313313863] [2024-12-02 10:10:29,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:10:29,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:10:29,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:10:29,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:10:29,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:10:29,685 INFO L87 Difference]: Start difference. First operand 715 states and 1036 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-12-02 10:10:29,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:10:29,759 INFO L93 Difference]: Finished difference Result 1319 states and 1921 transitions. [2024-12-02 10:10:29,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 10:10:29,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 73 [2024-12-02 10:10:29,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:10:29,762 INFO L225 Difference]: With dead ends: 1319 [2024-12-02 10:10:29,762 INFO L226 Difference]: Without dead ends: 717 [2024-12-02 10:10:29,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:10:29,764 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 826 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 10:10:29,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1697 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 10:10:29,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-12-02 10:10:29,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 707. [2024-12-02 10:10:29,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 706 states have (on average 1.453257790368272) internal successors, (1026), 706 states have internal predecessors, (1026), 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-12-02 10:10:29,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1026 transitions. [2024-12-02 10:10:29,780 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1026 transitions. Word has length 73 [2024-12-02 10:10:29,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:10:29,781 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 1026 transitions. [2024-12-02 10:10:29,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-12-02 10:10:29,781 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1026 transitions. [2024-12-02 10:10:29,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-12-02 10:10:29,781 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:10:29,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:10:29,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-02 10:10:29,782 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:10:29,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:10:29,782 INFO L85 PathProgramCache]: Analyzing trace with hash 420694957, now seen corresponding path program 1 times [2024-12-02 10:10:29,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:10:29,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802549837] [2024-12-02 10:10:29,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:10:29,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:10:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:10:29,818 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 10:10:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:10:29,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 10:10:29,886 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 10:10:29,887 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-02 10:10:29,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 10:10:29,892 INFO L422 BasicCegarLoop]: Path program 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-12-02 10:10:29,935 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 10:10:29,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 10:10:29 BoogieIcfgContainer [2024-12-02 10:10:29,938 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 10:10:29,938 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 10:10:29,938 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 10:10:29,938 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 10:10:29,939 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:10:19" (3/4) ... [2024-12-02 10:10:29,941 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-12-02 10:10:29,942 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 10:10:29,942 INFO L158 Benchmark]: Toolchain (without parser) took 13694.26ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 118.7MB in the beginning and 347.4MB in the end (delta: -228.7MB). Peak memory consumption was 147.2MB. Max. memory is 16.1GB. [2024-12-02 10:10:29,942 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 142.6MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 10:10:29,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.31ms. Allocated memory is still 142.6MB. Free memory was 118.7MB in the beginning and 91.9MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 10:10:29,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 204.79ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 95.4MB in the end (delta: -3.6MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-12-02 10:10:29,943 INFO L158 Benchmark]: Boogie Preprocessor took 211.00ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 75.9MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 10:10:29,943 INFO L158 Benchmark]: RCFGBuilder took 2275.20ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 75.9MB in the beginning and 179.9MB in the end (delta: -104.0MB). Peak memory consumption was 183.1MB. Max. memory is 16.1GB. [2024-12-02 10:10:29,943 INFO L158 Benchmark]: TraceAbstraction took 10645.36ms. Allocated memory was 427.8MB in the beginning and 520.1MB in the end (delta: 92.3MB). Free memory was 179.2MB in the beginning and 347.4MB in the end (delta: -168.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 10:10:29,944 INFO L158 Benchmark]: Witness Printer took 3.59ms. Allocated memory is still 520.1MB. Free memory was 347.4MB in the beginning and 347.4MB in the end (delta: 29.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 10:10:29,945 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.33ms. Allocated memory is still 142.6MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.31ms. Allocated memory is still 142.6MB. Free memory was 118.7MB in the beginning and 91.9MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 204.79ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 95.4MB in the end (delta: -3.6MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 211.00ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 75.9MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 2275.20ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 75.9MB in the beginning and 179.9MB in the end (delta: -104.0MB). Peak memory consumption was 183.1MB. Max. memory is 16.1GB. * TraceAbstraction took 10645.36ms. Allocated memory was 427.8MB in the beginning and 520.1MB in the end (delta: 92.3MB). Free memory was 179.2MB in the beginning and 347.4MB in the end (delta: -168.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.59ms. Allocated memory is still 520.1MB. Free memory was 347.4MB in the beginning and 347.4MB in the end (delta: 29.1kB). There was no memory consumed. 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 shiftRight at line 109, overapproximation of bitwiseAnd at line 116, overapproximation of bitwiseAnd at line 107, overapproximation of bitwiseAnd at line 111, overapproximation of bitwiseAnd at line 110. 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_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 5); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (5 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 16); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (16 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_3 var_5 = 0; [L39] const SORT_1 var_12 = 0; [L40] const SORT_4 var_27 = 17; [L41] const SORT_3 var_28 = 1; [L42] const SORT_3 var_30 = 0; [L43] const SORT_4 var_32 = 16; [L44] const SORT_4 var_79 = 20; [L46] SORT_1 input_37; [L47] SORT_1 input_38; [L48] SORT_1 input_43; [L49] SORT_1 input_48; [L50] SORT_1 input_52; [L51] SORT_1 input_57; [L53] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=65535, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L53] SORT_3 state_6 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L54] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=65535, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L54] SORT_3 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L55] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L55] SORT_3 state_10 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L56] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L57] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L58] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L59] SORT_1 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L60] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L61] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L62] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L64] SORT_3 init_7_arg_1 = var_5; [L65] state_6 = init_7_arg_1 [L66] SORT_3 init_9_arg_1 = var_5; [L67] state_8 = init_9_arg_1 [L68] SORT_3 init_11_arg_1 = var_5; [L69] state_10 = init_11_arg_1 [L70] SORT_1 init_14_arg_1 = var_12; [L71] state_13 = init_14_arg_1 [L72] SORT_1 init_16_arg_1 = var_12; [L73] state_15 = init_16_arg_1 [L74] SORT_1 init_18_arg_1 = var_12; [L75] state_17 = init_18_arg_1 [L76] SORT_1 init_20_arg_1 = var_12; [L77] state_19 = init_20_arg_1 [L78] SORT_1 init_22_arg_1 = var_12; [L79] state_21 = init_22_arg_1 [L80] SORT_1 init_24_arg_1 = var_12; [L81] state_23 = init_24_arg_1 [L82] SORT_1 init_26_arg_1 = var_12; [L83] state_25 = init_26_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=17, var_28=1, var_30=0, var_32=16, var_79=20] [L86] input_37 = __VERIFIER_nondet_uchar() [L87] EXPR input_37 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=17, var_28=1, var_30=0, var_32=16, var_79=20] [L87] input_37 = input_37 & mask_SORT_1 [L88] input_38 = __VERIFIER_nondet_uchar() [L89] EXPR input_38 & mask_SORT_1 VAL [input_37=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=17, var_28=1, var_30=0, var_32=16, var_79=20] [L89] input_38 = input_38 & mask_SORT_1 [L90] input_43 = __VERIFIER_nondet_uchar() [L91] EXPR input_43 & mask_SORT_1 VAL [input_37=0, input_38=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=17, var_28=1, var_30=0, var_32=16, var_79=20] [L91] input_43 = input_43 & mask_SORT_1 [L92] input_48 = __VERIFIER_nondet_uchar() [L93] EXPR input_48 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=17, var_28=1, var_30=0, var_32=16, var_79=20] [L93] input_48 = input_48 & mask_SORT_1 [L94] input_52 = __VERIFIER_nondet_uchar() [L95] EXPR input_52 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=17, var_28=1, var_30=0, var_32=16, var_79=20] [L95] input_52 = input_52 & mask_SORT_1 [L96] input_57 = __VERIFIER_nondet_uchar() [L97] EXPR input_57 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=17, var_28=1, var_30=0, var_32=16, var_79=20] [L97] input_57 = input_57 & mask_SORT_1 [L100] SORT_3 var_29_arg_0 = var_28; [L101] SORT_3 var_29_arg_1 = state_6; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_32=16, var_79=20] [L102] EXPR var_29_arg_0 ^ var_29_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_30=0, var_32=16, var_79=20] [L102] SORT_3 var_29 = var_29_arg_0 ^ var_29_arg_1; [L103] SORT_3 var_31_arg_0 = var_29; [L104] SORT_3 var_31_arg_1 = var_30; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_79=20] [L105] EXPR ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_79=20] [L105] SORT_4 var_31 = ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1; [L106] SORT_4 var_33_arg_0 = var_31; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=20] [L107] EXPR var_33_arg_0 & msb_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=20] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=20] [L107] EXPR var_33_arg_0 | ~mask_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_79=20] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_79=20] [L107] var_33_arg_0 = (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) [L108] SORT_4 var_33_arg_1 = var_32; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_33_arg_1=16, var_79=20] [L109] EXPR (int)var_33_arg_0 >> var_33_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_33_arg_1=16, var_79=20] [L109] SORT_4 var_33 = (int)var_33_arg_0 >> var_33_arg_1; [L110] EXPR var_33_arg_0 & msb_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33=17, var_33_arg_1=16, var_79=20] [L110] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_1=16, var_79=20] [L110] var_33 = (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 [L111] EXPR var_33 & mask_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_1=16, var_79=20] [L111] var_33 = var_33 & mask_SORT_4 [L112] SORT_4 var_34_arg_0 = var_27; [L113] SORT_4 var_34_arg_1 = var_33; [L114] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L115] SORT_1 var_35_arg_0 = ~state_25; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33=17, var_33_arg_1=16, var_34=1, var_35_arg_0=-1, var_79=20] [L116] EXPR var_35_arg_0 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33=17, var_33_arg_1=16, var_34=1, var_79=20] [L116] var_35_arg_0 = var_35_arg_0 & mask_SORT_1 [L117] SORT_1 var_35_arg_1 = var_34; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33=17, var_33_arg_1=16, var_35_arg_0=1, var_35_arg_1=1, var_79=20] [L118] EXPR var_35_arg_0 & var_35_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33=17, var_33_arg_1=16, var_79=20] [L118] SORT_1 var_35 = var_35_arg_0 & var_35_arg_1; [L119] EXPR var_35 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33=17, var_33_arg_1=16, var_79=20] [L119] var_35 = var_35 & mask_SORT_1 [L120] SORT_1 bad_36_arg_0 = var_35; [L121] CALL __VERIFIER_assert(!(bad_36_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 597 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12814 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12814 mSDsluCounter, 79495 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60715 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3405 IncrementalHoareTripleChecker+Invalid, 3428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 18780 mSDtfsCounter, 3405 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=728occurred in iteration=17, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 547 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1541 NumberOfCodeBlocks, 1541 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1446 ConstructedInterpolants, 0 QuantifiedInterpolants, 4939 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-12-02 10:10:29,964 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/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_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1 --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 10b9451aec1c717f408158c024da4f049a32ac1e1eb7cd36cf3cd1261409bb31 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 10:10:31,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 10:10:32,016 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-12-02 10:10:32,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 10:10:32,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 10:10:32,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 10:10:32,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 10:10:32,051 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 10:10:32,051 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 10:10:32,051 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 10:10:32,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 10:10:32,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 10:10:32,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 10:10:32,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 10:10:32,052 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 10:10:32,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 10:10:32,053 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 10:10:32,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 10:10:32,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 10:10:32,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 10:10:32,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 10:10:32,053 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 10:10:32,053 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-12-02 10:10:32,053 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-12-02 10:10:32,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 10:10:32,053 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 10:10:32,053 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 10:10:32,053 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 10:10:32,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 10:10:32,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 10:10:32,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 10:10:32,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 10:10:32,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 10:10:32,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 10:10:32,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 10:10:32,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 10:10:32,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 10:10:32,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 10:10:32,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 10:10:32,054 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 10:10:32,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 10:10:32,055 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-12-02 10:10:32,055 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-12-02 10:10:32,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 10:10:32,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 10:10:32,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 10:10:32,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 10:10:32,056 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_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1 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 -> 10b9451aec1c717f408158c024da4f049a32ac1e1eb7cd36cf3cd1261409bb31 [2024-12-02 10:10:32,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 10:10:32,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 10:10:32,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 10:10:32,322 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 10:10:32,322 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 10:10:32,324 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c [2024-12-02 10:10:35,028 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/data/43bc30226/511481e8bb3944c8a7d3b6d62f58794f/FLAG5adf8c849 [2024-12-02 10:10:35,246 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 10:10:35,246 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c [2024-12-02 10:10:35,255 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/data/43bc30226/511481e8bb3944c8a7d3b6d62f58794f/FLAG5adf8c849 [2024-12-02 10:10:35,270 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/data/43bc30226/511481e8bb3944c8a7d3b6d62f58794f [2024-12-02 10:10:35,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 10:10:35,274 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 10:10:35,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 10:10:35,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 10:10:35,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 10:10:35,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:10:35" (1/1) ... [2024-12-02 10:10:35,281 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e5d57b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:35, skipping insertion in model container [2024-12-02 10:10:35,281 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:10:35" (1/1) ... [2024-12-02 10:10:35,303 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 10:10:35,438 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_b3dee77b-c690-421b-8d25-fd286152a97b/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c[1173,1186] [2024-12-02 10:10:35,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 10:10:35,546 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 10:10:35,557 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_b3dee77b-c690-421b-8d25-fd286152a97b/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c[1173,1186] [2024-12-02 10:10:35,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 10:10:35,627 INFO L204 MainTranslator]: Completed translation [2024-12-02 10:10:35,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:35 WrapperNode [2024-12-02 10:10:35,628 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 10:10:35,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 10:10:35,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 10:10:35,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 10:10:35,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:35" (1/1) ... [2024-12-02 10:10:35,643 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:35" (1/1) ... [2024-12-02 10:10:35,668 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 452 [2024-12-02 10:10:35,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 10:10:35,669 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 10:10:35,669 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 10:10:35,669 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 10:10:35,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:35" (1/1) ... [2024-12-02 10:10:35,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:35" (1/1) ... [2024-12-02 10:10:35,680 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:35" (1/1) ... [2024-12-02 10:10:35,697 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-12-02 10:10:35,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:35" (1/1) ... [2024-12-02 10:10:35,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:35" (1/1) ... [2024-12-02 10:10:35,710 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:35" (1/1) ... [2024-12-02 10:10:35,711 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:35" (1/1) ... [2024-12-02 10:10:35,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:35" (1/1) ... [2024-12-02 10:10:35,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:35" (1/1) ... [2024-12-02 10:10:35,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:35" (1/1) ... [2024-12-02 10:10:35,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 10:10:35,734 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 10:10:35,734 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 10:10:35,734 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 10:10:35,735 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:35" (1/1) ... [2024-12-02 10:10:35,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 10:10:35,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:10:35,765 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 10:10:35,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 10:10:35,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 10:10:35,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-12-02 10:10:35,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 10:10:35,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 10:10:35,919 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 10:10:35,920 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 10:10:36,311 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-12-02 10:10:36,311 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 10:10:36,319 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 10:10:36,319 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-02 10:10:36,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:10:36 BoogieIcfgContainer [2024-12-02 10:10:36,320 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 10:10:36,322 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 10:10:36,322 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 10:10:36,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 10:10:36,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 10:10:35" (1/3) ... [2024-12-02 10:10:36,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e0bbc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:10:36, skipping insertion in model container [2024-12-02 10:10:36,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:10:35" (2/3) ... [2024-12-02 10:10:36,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e0bbc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:10:36, skipping insertion in model container [2024-12-02 10:10:36,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:10:36" (3/3) ... [2024-12-02 10:10:36,329 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.1.prop1-func-interl.c [2024-12-02 10:10:36,344 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 10:10:36,345 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.adding.1.prop1-func-interl.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-12-02 10:10:36,391 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 10:10:36,402 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;@25eab4d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 10:10:36,402 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 10:10:36,405 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-12-02 10:10:36,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-02 10:10:36,410 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:10:36,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-12-02 10:10:36,411 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:10:36,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:10:36,415 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-12-02 10:10:36,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 10:10:36,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1921007007] [2024-12-02 10:10:36,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:10:36,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:10:36,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:10:36,428 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:10:36,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 10:10:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:10:36,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-12-02 10:10:36,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:10:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:10:36,947 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:10:36,948 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 10:10:36,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921007007] [2024-12-02 10:10:36,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921007007] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:10:36,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:10:36,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 10:10:36,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369333235] [2024-12-02 10:10:36,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:10:36,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:10:36,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 10:10:36,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:10:36,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:10:36,975 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-12-02 10:10:37,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:10:37,037 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-12-02 10:10:37,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 10:10:37,040 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-12-02 10:10:37,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:10:37,046 INFO L225 Difference]: With dead ends: 17 [2024-12-02 10:10:37,046 INFO L226 Difference]: Without dead ends: 9 [2024-12-02 10:10:37,049 INFO L434 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-12-02 10:10:37,052 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 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.1s IncrementalHoareTripleChecker+Time [2024-12-02 10:10:37,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 10:10:37,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-12-02 10:10:37,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-12-02 10:10:37,078 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-12-02 10:10:37,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-12-02 10:10:37,082 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-12-02 10:10:37,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:10:37,082 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-12-02 10:10:37,082 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-12-02 10:10:37,082 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-12-02 10:10:37,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-02 10:10:37,083 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:10:37,083 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-12-02 10:10:37,093 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 10:10:37,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:10:37,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:10:37,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:10:37,284 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-12-02 10:10:37,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 10:10:37,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1418953488] [2024-12-02 10:10:37,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:10:37,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:10:37,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:10:37,287 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:10:37,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 10:10:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:10:37,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-12-02 10:10:37,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:10:47,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:10:47,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:11:08,806 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 (_ bv255 32))))) (.cse10 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_17~0#1|))) (let ((.cse119 (bvnot (bvlshr |c_ULTIMATE.start_main_~mask_SORT_4~0#1| |c_ULTIMATE.start_main_~var_32~0#1|))) (.cse121 (bvnot |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse118 ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_28~0#1|)) (.cse62 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse22 .cse10)))) (.cse74 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 (_ bv254 32))))) (.cse24 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_23~0#1|))) (let ((.cse3 (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse249 ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|))))) (or (= ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse242 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse230 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse232 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse236 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse238 ((_ zero_extend 24) .cse249))) (let ((.cse237 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse238))))))) (.cse241 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse236))))))) (.cse234 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse232))))))) (.cse233 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse230))))))) (.cse240 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse242))))))) (.cse231 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse235 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse4)))) (.cse239 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse243 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse224 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse241 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse242 .cse243))))))) (.cse225 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse238 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse239 .cse240)))))))) (let ((.cse222 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse236 .cse24))) .cse237)))) (.cse223 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse224 .cse225))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse222 .cse223))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse224 .cse225)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse226 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse234 .cse235))))))) (.cse227 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse231 .cse232))) .cse233))))) (let ((.cse228 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse230 .cse10))))))) (.cse229 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse226 .cse227))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse226 .cse227))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse228 .cse229))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse228 .cse229))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse222 .cse223)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse246 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse232 .cse230)))))))) (let ((.cse245 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse242 .cse246))))) (let ((.cse244 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse236 .cse245))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse244 .cse238))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse236 .cse245))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse242 .cse246))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse232 .cse230))) (_ bv0 32))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse244 .cse238))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse237 .cse24))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse241 .cse243))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse62 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse234 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse235 .cse74)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse231 .cse233))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse240 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse239 .cse74)))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse247 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse239 .cse243))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse239 .cse243))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse247 .cse24))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse248 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse231 .cse235))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse248 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse231 .cse235)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse248 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse247 .cse24)))))))))))))))))))))))))))))) (_ bv1 32)))))) (_ bv0 8)) (= (_ bv0 8) .cse249))))) (.cse125 (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse220 ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|)))) (.cse221 ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|))))) (or (= ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse198 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse204 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse196 ((_ zero_extend 24) .cse221)) (.cse201 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse200 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse202 ((_ zero_extend 24) .cse220))) (let ((.cse208 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse202))))))) (.cse209 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse200))))))) (.cse195 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse4)))) (.cse194 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse210 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse201))))))) (.cse206 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse196))))))) (.cse190 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse211 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse204))))))) (.cse207 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse198))))))) (.cse191 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse192 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse190 .cse191))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse190 .cse191))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse192 .cse24))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse193 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse194 .cse195))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse193 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse194 .cse195)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse193 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse192 .cse24))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse203 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse200 .cse201))))) (let ((.cse205 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse202 .cse203))))) (let ((.cse199 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse204 .cse205))))) (let ((.cse197 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse198 .cse199))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse196 .cse197))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse198 .cse199))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse200 .cse201))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse202 .cse203)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse204 .cse205)))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse206 .cse24))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse207 .cse191))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse10 .cse208))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse209 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse195 .cse74)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse194 .cse210))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse211 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse190 .cse74))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse196 .cse197)))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse218 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse207 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse204 .cse191))))))) (.cse219 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse196 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse190 .cse211)))))))) (let ((.cse216 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse198 .cse24))) .cse206)))) (.cse217 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse218 .cse219))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse214 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse194 .cse200))) .cse210)))) (.cse215 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse202 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse209 .cse195)))))))) (let ((.cse212 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse214 .cse215)))) (.cse213 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse201 .cse10))) .cse208))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse212 .cse213))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse214 .cse215))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse212 .cse213))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse216 .cse217))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse218 .cse219))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse216 .cse217))))))))))))))))))))))))))))))))) (_ bv0 8)) (= (_ bv0 8) .cse220) (= (_ bv0 8) .cse221))))) (.cse1 (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16)) (|ULTIMATE.start_main_~state_10~0#1| (_ BitVec 16))) (let ((.cse189 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_10~0#1|))) .cse118))) .cse118))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvor .cse119 (bvashr (bvor .cse189 .cse121) |c_ULTIMATE.start_main_~var_32~0#1|))) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse189) (_ bv0 32)))))) (.cse127 (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse157 ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|)))) (.cse188 ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|))))) (or (= (_ bv0 8) .cse157) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse176 ((_ zero_extend 24) .cse188)) (.cse164 ((_ zero_extend 24) .cse157)) (.cse162 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse168 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse180 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse174 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|))) (let ((.cse179 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse174))))))) (.cse178 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse180))))))) (.cse165 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse168))))))) (.cse169 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse162))))))) (.cse163 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse164))))))) (.cse175 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse176))))))) (.cse167 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse166 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse4)))) (.cse177 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse181 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse172 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse179 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse180 .cse181))))))) (.cse173 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse176 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse177 .cse178)))))))) (let ((.cse170 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse174 .cse24))) .cse175)))) (.cse171 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse172 .cse173))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse160 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse167 .cse168))) .cse169)))) (.cse161 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse164 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse165 .cse166)))))))) (let ((.cse158 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse160 .cse161)))) (.cse159 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse162 .cse10))) .cse163))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse158 .cse159))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse160 .cse161))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse158 .cse159))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse170 .cse171))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse172 .cse173))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse170 .cse171)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse184 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse168 .cse162))))) (let ((.cse185 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse164 .cse184))))) (let ((.cse183 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse180 .cse185))))) (let ((.cse182 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse174 .cse183))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse176 .cse182))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse174 .cse183))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse168 .cse162))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse164 .cse184)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse180 .cse185)))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse176 .cse182))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse179 .cse181))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse177 .cse22))) .cse178))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse166 .cse22))) .cse165))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse167 .cse169)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse10 .cse163)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse175 .cse24)))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse186 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse177 .cse181))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse177 .cse181))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse186 .cse24))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse187 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse167 .cse166))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse187 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse167 .cse166)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse187 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse186 .cse24)))))))))))))))))))))))))))))))))))) (= (_ bv0 8) .cse188))))) (.cse0 (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse129 ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|))))) (or (= (_ bv0 8) .cse129) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse146 ((_ zero_extend 24) .cse129)) (.cse138 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse140 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse150 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse144 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|))) (let ((.cse149 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse144))))))) (.cse151 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse147 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse148 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse150))))))) (.cse143 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse4)))) (.cse142 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse140))))))) (.cse139 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse141 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse138))))))) (.cse145 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse146)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse132 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse149 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse150 .cse151))))))) (.cse133 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse146 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse147 .cse148)))))))) (let ((.cse130 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse144 .cse24))) .cse145)))) (.cse131 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse132 .cse133))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse130 .cse131))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse132 .cse133)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse134 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse142 .cse143))))))) (.cse135 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse139 .cse140))) .cse141))))) (let ((.cse136 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse138 .cse10))))))) (.cse137 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse134 .cse135))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse134 .cse135))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse136 .cse137))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse136 .cse137))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse130 .cse131)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse152 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse147 .cse151))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse147 .cse151))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse152 .cse24))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse153 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse139 .cse143))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse153 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse139 .cse143)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse153 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse152 .cse24))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse156 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse140 .cse138)))))))) (let ((.cse155 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse150 .cse156))))) (let ((.cse154 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse144 .cse155))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse149 .cse151))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse147 .cse22))) .cse148))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse143 .cse22))) .cse142))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse139 .cse141)))))) .cse62))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse145 .cse24)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse154 .cse146)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse154 .cse146))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse144 .cse155))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse150 .cse156))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse140 .cse138))) (_ bv0 32))))))))))))))))))))))))))))))))))))))))))))) .cse4))) (_ bv1 32))))))))))) (.cse2 (forall ((|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|))))))) (.cse126 (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16)) (|ULTIMATE.start_main_~state_10~0#1| (_ BitVec 16))) (let ((.cse128 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_10~0#1|))) .cse118))) .cse118))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= |c_ULTIMATE.start_main_~var_27~0#1| (bvand (bvashr (bvand .cse128 |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_32~0#1|) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|))) (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse128) (_ bv0 32)))))))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse1 .cse2) (or (forall ((|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|)))))) (let ((.cse38 (let ((.cse123 (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor .cse118 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) |c_ULTIMATE.start_main_~state_6~0#1|) .cse118)))))))))) .cse118))) (_ bv16 32)))) (and (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse122 (bvor .cse123 ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse122) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|)) (not (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse122)))))) (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse124 (bvor .cse123 ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse124)) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvor .cse119 (bvashr (bvor .cse121 .cse124) |c_ULTIMATE.start_main_~var_32~0#1|))) |c_ULTIMATE.start_main_~var_27~0#1|)))))))) (.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse22 .cse24)))) (.cse37 (and (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse117 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_8~0#1|))))) .cse118))) .cse118))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse117))) (not (= |c_ULTIMATE.start_main_~var_27~0#1| (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse117) |c_ULTIMATE.start_main_~var_32~0#1|))))))) (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse120 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_8~0#1|))))) .cse118))) .cse118))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (bvand (bvor .cse119 (bvashr (bvor .cse120 .cse121) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse120)))))))) (and (or (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse36 ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse12 ((_ zero_extend 24) .cse36)) (.cse9 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse16 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse26 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse23 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|))) (let ((.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse23))))))) (.cse27 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse26))))))) (.cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse4)))) (.cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse16))))))) (.cse15 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse9))))))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse12)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse29))))))) (.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse26 .cse27)))))))) (let ((.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse18 .cse19)))) (.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse23 .cse24)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse15 .cse16))) .cse17)))) (.cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse13 .cse14)))))))) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse7 .cse8)))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse9 .cse10))) .cse11))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse5 .cse6))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 .cse8))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse6))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse19))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse20 .cse21))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse20 .cse21)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse28 .cse27))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse27))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse24))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse15 .cse14))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse31 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 .cse14)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse31 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse30 .cse24))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse16 .cse9))))) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse12 .cse34))))) (let ((.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse26 .cse35))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse23 .cse32)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse25 .cse27))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse22))) .cse29))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 .cse22))) .cse13))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse15 .cse17)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse10 .cse11)))))))))))) .cse33)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse32))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 .cse9))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 .cse34)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse26 .cse35)))))))))))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))))))))))))))))))))) .cse4))) (= (_ bv0 8) .cse36)))) .cse37) (or .cse38 (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse47 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse49 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse55 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse53 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|))) (let ((.cse54 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse53))))))) (.cse56 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse57 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse58 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse55))))))) (.cse52 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse4)))) (.cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse49))))))) (.cse48 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse50 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse47)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse57 .cse58))))))) (.cse42 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse54 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse55 .cse56)))))))) (let ((.cse39 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse41 .cse42)))) (.cse40 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse53 .cse24)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse39 .cse40))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 .cse42))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse39 .cse40)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse51 .cse52))))))) (.cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse48 .cse49))) .cse50))))) (let ((.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse47 .cse10))))))) (.cse46 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse43 .cse44))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse43 .cse44))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse46))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse45 .cse46)))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse59 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse57 .cse56))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse57 .cse56))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse59 .cse24))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse60 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse48 .cse52))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse60 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse48 .cse52)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse60 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse59 .cse24))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse63 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse49 .cse47)))))))) (let ((.cse61 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse55 .cse63))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse53 .cse61))) (_ bv0 32)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse54 .cse56))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse57 .cse22))) .cse58))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse52 .cse22))) .cse51))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse48 .cse50)))))) .cse62))))))))) .cse33)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse53 .cse61))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse55 .cse63))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse49 .cse47))) (_ bv0 32)))))))))))))))))))))))))))))))))))))))))))) .cse4))) (_ bv1 32)))))))) .cse2) (or .cse38 (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse77 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse70 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse79 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse80 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|))) (let ((.cse68 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse75 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse80))))))) (.cse73 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse79))))))) (.cse69 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse4)))) (.cse72 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse70))))))) (.cse65 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse64 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse77)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse66 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse64 .cse65))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse64 .cse65))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse66 .cse24))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse67 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse68 .cse69))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse67 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse68 .cse69)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse67 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse66 .cse24))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse78 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse79 .cse80)))))))) (let ((.cse71 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse77 .cse78))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse70 .cse71))) (_ bv0 32)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse72 .cse65))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse62 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse73 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse69 .cse74)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse68 .cse75))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse64 .cse74)))))))))))) .cse33)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse70 .cse71))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse77 .cse78))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse79 .cse80))) (_ bv0 32))))))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse83 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse64 .cse76))))))) (.cse84 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse72 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse77 .cse65)))))))) (let ((.cse81 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse83 .cse84)))) (.cse82 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse70 .cse24)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse81 .cse82))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse83 .cse84))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse81 .cse82)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse85 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse73 .cse69))))))) (.cse86 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse68 .cse79))) .cse75))))) (let ((.cse87 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse80 .cse10))))))) (.cse88 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse85 .cse86))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse85 .cse86))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse87 .cse88))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse87 .cse88))))))))))))))))))))))))))))))))))))))))))) .cse2) (or (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse89 ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|))))) (or (= (_ bv0 8) .cse89) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse108 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse94 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse100 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse96 ((_ zero_extend 24) .cse89)) (.cse106 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|))) (let ((.cse107 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse106))))))) (.cse95 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse96))))))) (.cse97 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse100))))))) (.cse101 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse94))))))) (.cse111 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse108))))))) (.cse99 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse98 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse4)))) (.cse110 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse109 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse102 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse110 .cse111))))))) (.cse103 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse107 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse108 .cse109)))))))) (let ((.cse104 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse102 .cse103)))) (.cse105 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse106 .cse24)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse92 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse99 .cse100))) .cse101)))) (.cse93 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse96 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse97 .cse98)))))))) (let ((.cse90 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse92 .cse93)))) (.cse91 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse94 .cse10))) .cse95))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse90 .cse91))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse92 .cse93))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse90 .cse91))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse102 .cse103))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse104 .cse105))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse104 .cse105)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse113 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse100 .cse94))))) (let ((.cse114 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse96 .cse113))))) (let ((.cse112 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse108 .cse114))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse106 .cse112))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse100 .cse94))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse96 .cse113)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse108 .cse114)))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse107 .cse109))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse10 .cse95))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse97 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse98 .cse74)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse99 .cse101))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse111 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse110 .cse74)))))))))))) .cse33))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse106 .cse112))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse115 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse110 .cse109))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse110 .cse109))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse115 .cse24))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse116 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse99 .cse98))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse116 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse99 .cse98)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse116 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse115 .cse24))))))))))))))))))))) .cse4)))))))))))))))))) .cse37)))) (or .cse1 .cse125) (or .cse3 .cse2 .cse126) (or .cse125 .cse126) (or .cse127 .cse126) (or .cse1 .cse127) (or .cse0 .cse2 .cse126)))))) is different from false [2024-12-02 10:11:09,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-12-02 10:11:09,262 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 10:11:09,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418953488] [2024-12-02 10:11:09,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418953488] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:11:09,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 10:11:09,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-12-02 10:11:09,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654926555] [2024-12-02 10:11:09,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 10:11:09,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 10:11:09,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 10:11:09,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 10:11:09,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=83, Unknown=1, NotChecked=18, Total=132 [2024-12-02 10:11:09,265 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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-12-02 10:11:11,739 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-12-02 10:11:11,739 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-12-02 10:11:11,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-02 10:11:11,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=30, Invalid=83, Unknown=1, NotChecked=18, Total=132 [2024-12-02 10:11:11,740 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:11,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 10:11:11,747 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 10:11:11,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:11,942 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:842) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 47 more [2024-12-02 10:11:11,946 INFO L158 Benchmark]: Toolchain (without parser) took 36672.32ms. Allocated memory was 92.3MB in the beginning and 302.0MB in the end (delta: 209.7MB). Free memory was 69.0MB in the beginning and 257.4MB in the end (delta: -188.4MB). Peak memory consumption was 179.9MB. Max. memory is 16.1GB. [2024-12-02 10:11:11,946 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 10:11:11,947 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.26ms. Allocated memory is still 92.3MB. Free memory was 68.8MB in the beginning and 47.0MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 10:11:11,947 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.08ms. Allocated memory is still 92.3MB. Free memory was 46.9MB in the beginning and 43.1MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 10:11:11,947 INFO L158 Benchmark]: Boogie Preprocessor took 64.42ms. Allocated memory is still 92.3MB. Free memory was 43.1MB in the beginning and 67.0MB in the end (delta: -23.9MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-12-02 10:11:11,947 INFO L158 Benchmark]: RCFGBuilder took 585.70ms. Allocated memory is still 92.3MB. Free memory was 67.0MB in the beginning and 38.5MB in the end (delta: 28.5MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2024-12-02 10:11:11,948 INFO L158 Benchmark]: TraceAbstraction took 35623.59ms. Allocated memory was 92.3MB in the beginning and 302.0MB in the end (delta: 209.7MB). Free memory was 38.1MB in the beginning and 257.4MB in the end (delta: -219.4MB). Peak memory consumption was 148.3MB. Max. memory is 16.1GB. [2024-12-02 10:11:11,950 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.43ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.26ms. Allocated memory is still 92.3MB. Free memory was 68.8MB in the beginning and 47.0MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.08ms. Allocated memory is still 92.3MB. Free memory was 46.9MB in the beginning and 43.1MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.42ms. Allocated memory is still 92.3MB. Free memory was 43.1MB in the beginning and 67.0MB in the end (delta: -23.9MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * RCFGBuilder took 585.70ms. Allocated memory is still 92.3MB. Free memory was 67.0MB in the beginning and 38.5MB in the end (delta: 28.5MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. * TraceAbstraction took 35623.59ms. Allocated memory was 92.3MB in the beginning and 302.0MB in the end (delta: 209.7MB). Free memory was 38.1MB in the beginning and 257.4MB in the end (delta: -219.4MB). Peak memory consumption was 148.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3dee77b-c690-421b-8d25-fd286152a97b/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")