./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-token-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 01:01:58,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 01:01:58,962 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-12 01:01:58,968 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 01:01:58,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 01:01:58,996 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 01:01:58,996 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 01:01:58,997 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 01:01:58,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 01:01:58,998 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 01:01:58,999 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 01:01:58,999 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 01:01:59,000 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 01:01:59,001 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 01:01:59,001 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 01:01:59,002 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 01:01:59,002 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 01:01:59,003 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 01:01:59,003 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 01:01:59,004 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 01:01:59,005 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 01:01:59,005 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 01:01:59,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 01:01:59,007 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 01:01:59,007 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 01:01:59,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 01:01:59,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 01:01:59,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 01:01:59,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 01:01:59,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 01:01:59,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 01:01:59,011 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 01:01:59,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 01:01:59,011 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 01:01:59,012 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 01:01:59,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 01:01:59,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 01:01:59,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 01:01:59,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 01:01:59,014 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 01:01:59,014 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 01:01:59,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 01:01:59,015 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 01:01:59,016 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 01:01:59,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 01:01:59,016 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2023-11-12 01:01:59,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 01:01:59,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 01:01:59,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 01:01:59,325 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 01:01:59,325 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 01:01:59,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/forester-heap/dll-token-1.i [2023-11-12 01:02:02,367 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 01:02:02,696 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 01:02:02,697 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i [2023-11-12 01:02:02,717 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/data/ea1825f89/5dd9f6a674bc4403a193e9c30fbddb72/FLAG34a5d3922 [2023-11-12 01:02:02,736 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/data/ea1825f89/5dd9f6a674bc4403a193e9c30fbddb72 [2023-11-12 01:02:02,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 01:02:02,747 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 01:02:02,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 01:02:02,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 01:02:02,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 01:02:02,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:02:02" (1/1) ... [2023-11-12 01:02:02,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4846edd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:02, skipping insertion in model container [2023-11-12 01:02:02,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:02:02" (1/1) ... [2023-11-12 01:02:02,826 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 01:02:03,271 WARN L240 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_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2023-11-12 01:02:03,294 WARN L240 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_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2023-11-12 01:02:03,296 WARN L240 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_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2023-11-12 01:02:03,298 WARN L240 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_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2023-11-12 01:02:03,299 WARN L240 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_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2023-11-12 01:02:03,303 WARN L240 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_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2023-11-12 01:02:03,311 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 01:02:03,325 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 01:02:03,365 WARN L240 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_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2023-11-12 01:02:03,367 WARN L240 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_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2023-11-12 01:02:03,369 WARN L240 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_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2023-11-12 01:02:03,370 WARN L240 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_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2023-11-12 01:02:03,371 WARN L240 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_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2023-11-12 01:02:03,373 WARN L240 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_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2023-11-12 01:02:03,375 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 01:02:03,410 INFO L206 MainTranslator]: Completed translation [2023-11-12 01:02:03,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:03 WrapperNode [2023-11-12 01:02:03,411 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 01:02:03,412 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 01:02:03,412 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 01:02:03,413 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 01:02:03,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:03" (1/1) ... [2023-11-12 01:02:03,453 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:03" (1/1) ... [2023-11-12 01:02:03,480 INFO L138 Inliner]: procedures = 119, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 130 [2023-11-12 01:02:03,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 01:02:03,481 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 01:02:03,481 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 01:02:03,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 01:02:03,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:03" (1/1) ... [2023-11-12 01:02:03,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:03" (1/1) ... [2023-11-12 01:02:03,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:03" (1/1) ... [2023-11-12 01:02:03,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:03" (1/1) ... [2023-11-12 01:02:03,508 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:03" (1/1) ... [2023-11-12 01:02:03,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:03" (1/1) ... [2023-11-12 01:02:03,528 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:03" (1/1) ... [2023-11-12 01:02:03,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:03" (1/1) ... [2023-11-12 01:02:03,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 01:02:03,541 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 01:02:03,541 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 01:02:03,548 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 01:02:03,549 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:03" (1/1) ... [2023-11-12 01:02:03,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 01:02:03,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:02:03,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 01:02:03,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 01:02:03,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 01:02:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 01:02:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 01:02:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 01:02:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 01:02:03,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 01:02:03,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 01:02:03,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 01:02:03,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 01:02:03,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 01:02:03,803 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 01:02:03,804 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 01:02:04,054 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 01:02:04,076 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 01:02:04,082 INFO L302 CfgBuilder]: Removed 15 assume(true) statements. [2023-11-12 01:02:04,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:02:04 BoogieIcfgContainer [2023-11-12 01:02:04,085 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 01:02:04,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 01:02:04,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 01:02:04,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 01:02:04,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:02:02" (1/3) ... [2023-11-12 01:02:04,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e191a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:02:04, skipping insertion in model container [2023-11-12 01:02:04,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:03" (2/3) ... [2023-11-12 01:02:04,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e191a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:02:04, skipping insertion in model container [2023-11-12 01:02:04,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:02:04" (3/3) ... [2023-11-12 01:02:04,100 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2023-11-12 01:02:04,121 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 01:02:04,122 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-12 01:02:04,170 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 01:02:04,178 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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;@26810d92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 01:02:04,178 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-12 01:02:04,183 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 40 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) [2023-11-12 01:02:04,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 01:02:04,189 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:04,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 01:02:04,190 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-12 01:02:04,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:04,195 INFO L85 PathProgramCache]: Analyzing trace with hash 177379778, now seen corresponding path program 1 times [2023-11-12 01:02:04,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:02:04,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770042553] [2023-11-12 01:02:04,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:04,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:02:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:04,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:02:04,544 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:02:04,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770042553] [2023-11-12 01:02:04,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770042553] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:02:04,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:02:04,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 01:02:04,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891269606] [2023-11-12 01:02:04,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:02:04,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 01:02:04,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:02:04,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 01:02:04,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 01:02:04,601 INFO L87 Difference]: Start difference. First operand has 41 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 40 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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) [2023-11-12 01:02:04,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:04,654 INFO L93 Difference]: Finished difference Result 81 states and 127 transitions. [2023-11-12 01:02:04,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 01:02:04,656 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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 [2023-11-12 01:02:04,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:04,670 INFO L225 Difference]: With dead ends: 81 [2023-11-12 01:02:04,671 INFO L226 Difference]: Without dead ends: 38 [2023-11-12 01:02:04,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 01:02:04,682 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:04,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 01:02:04,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-12 01:02:04,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-12 01:02:04,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.25) internal successors, (40), 37 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2023-11-12 01:02:04,728 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 5 [2023-11-12 01:02:04,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:04,729 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2023-11-12 01:02:04,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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) [2023-11-12 01:02:04,729 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2023-11-12 01:02:04,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 01:02:04,731 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:04,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 01:02:04,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 01:02:04,733 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-12 01:02:04,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:04,735 INFO L85 PathProgramCache]: Analyzing trace with hash 176613157, now seen corresponding path program 1 times [2023-11-12 01:02:04,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:02:04,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455229711] [2023-11-12 01:02:04,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:04,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:02:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:05,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:02:05,256 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:02:05,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455229711] [2023-11-12 01:02:05,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455229711] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:02:05,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:02:05,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 01:02:05,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669860493] [2023-11-12 01:02:05,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:02:05,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 01:02:05,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:02:05,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 01:02:05,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 01:02:05,261 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 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) [2023-11-12 01:02:05,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:05,358 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2023-11-12 01:02:05,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 01:02:05,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 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 [2023-11-12 01:02:05,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:05,360 INFO L225 Difference]: With dead ends: 38 [2023-11-12 01:02:05,361 INFO L226 Difference]: Without dead ends: 36 [2023-11-12 01:02:05,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 01:02:05,363 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:05,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 72 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 01:02:05,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-12 01:02:05,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-11-12 01:02:05,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 35 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:05,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2023-11-12 01:02:05,371 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 5 [2023-11-12 01:02:05,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:05,371 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2023-11-12 01:02:05,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 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) [2023-11-12 01:02:05,372 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2023-11-12 01:02:05,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 01:02:05,373 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:05,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 01:02:05,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 01:02:05,373 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-12 01:02:05,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:05,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1179997057, now seen corresponding path program 1 times [2023-11-12 01:02:05,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:02:05,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726722181] [2023-11-12 01:02:05,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:05,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:02:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:05,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:02:05,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:02:05,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726722181] [2023-11-12 01:02:05,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726722181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:02:05,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:02:05,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 01:02:05,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430583037] [2023-11-12 01:02:05,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:02:05,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 01:02:05,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:02:05,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 01:02:05,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 01:02:05,483 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:05,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:05,581 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2023-11-12 01:02:05,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 01:02:05,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2023-11-12 01:02:05,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:05,584 INFO L225 Difference]: With dead ends: 62 [2023-11-12 01:02:05,584 INFO L226 Difference]: Without dead ends: 60 [2023-11-12 01:02:05,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 01:02:05,586 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 76 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:05,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 44 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 01:02:05,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-12 01:02:05,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 34. [2023-11-12 01:02:05,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.2) internal successors, (36), 33 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:05,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2023-11-12 01:02:05,598 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 6 [2023-11-12 01:02:05,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:05,599 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2023-11-12 01:02:05,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:05,599 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2023-11-12 01:02:05,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 01:02:05,601 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:05,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:02:05,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 01:02:05,602 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-12 01:02:05,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:05,605 INFO L85 PathProgramCache]: Analyzing trace with hash -941369743, now seen corresponding path program 1 times [2023-11-12 01:02:05,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:02:05,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876007396] [2023-11-12 01:02:05,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:05,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:02:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:05,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:02:05,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:02:05,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876007396] [2023-11-12 01:02:05,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876007396] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:02:05,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:02:05,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 01:02:05,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270316302] [2023-11-12 01:02:05,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:02:05,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 01:02:05,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:02:05,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 01:02:05,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 01:02:05,752 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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) [2023-11-12 01:02:05,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:05,867 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2023-11-12 01:02:05,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 01:02:05,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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) Word has length 11 [2023-11-12 01:02:05,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:05,868 INFO L225 Difference]: With dead ends: 34 [2023-11-12 01:02:05,868 INFO L226 Difference]: Without dead ends: 32 [2023-11-12 01:02:05,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 01:02:05,870 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:05,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 87 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 01:02:05,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-12 01:02:05,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-12 01:02:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:05,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2023-11-12 01:02:05,877 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 11 [2023-11-12 01:02:05,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:05,878 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2023-11-12 01:02:05,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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) [2023-11-12 01:02:05,878 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2023-11-12 01:02:05,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 01:02:05,879 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:05,879 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:02:05,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 01:02:05,880 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-12 01:02:05,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:05,881 INFO L85 PathProgramCache]: Analyzing trace with hash -941332007, now seen corresponding path program 1 times [2023-11-12 01:02:05,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:02:05,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921452235] [2023-11-12 01:02:05,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:05,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:02:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:06,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:02:06,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:02:06,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921452235] [2023-11-12 01:02:06,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921452235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:02:06,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:02:06,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 01:02:06,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776784752] [2023-11-12 01:02:06,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:02:06,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 01:02:06,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:02:06,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 01:02:06,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 01:02:06,261 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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) [2023-11-12 01:02:06,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:06,411 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2023-11-12 01:02:06,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 01:02:06,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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) Word has length 11 [2023-11-12 01:02:06,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:06,413 INFO L225 Difference]: With dead ends: 67 [2023-11-12 01:02:06,413 INFO L226 Difference]: Without dead ends: 43 [2023-11-12 01:02:06,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 01:02:06,416 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:06,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 89 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 01:02:06,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-12 01:02:06,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2023-11-12 01:02:06,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:06,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2023-11-12 01:02:06,434 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 11 [2023-11-12 01:02:06,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:06,435 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2023-11-12 01:02:06,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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) [2023-11-12 01:02:06,436 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2023-11-12 01:02:06,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 01:02:06,436 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:06,437 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:02:06,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 01:02:06,437 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-12 01:02:06,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:06,438 INFO L85 PathProgramCache]: Analyzing trace with hash -207114599, now seen corresponding path program 1 times [2023-11-12 01:02:06,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:02:06,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749960518] [2023-11-12 01:02:06,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:06,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:02:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:07,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:02:07,123 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:02:07,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749960518] [2023-11-12 01:02:07,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749960518] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:02:07,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:02:07,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 01:02:07,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435593662] [2023-11-12 01:02:07,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:02:07,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 01:02:07,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:02:07,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 01:02:07,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 01:02:07,126 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:07,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:07,293 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2023-11-12 01:02:07,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 01:02:07,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2023-11-12 01:02:07,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:07,295 INFO L225 Difference]: With dead ends: 49 [2023-11-12 01:02:07,295 INFO L226 Difference]: Without dead ends: 47 [2023-11-12 01:02:07,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-12 01:02:07,296 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:07,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 104 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 01:02:07,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-12 01:02:07,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2023-11-12 01:02:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 44 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:07,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2023-11-12 01:02:07,305 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 15 [2023-11-12 01:02:07,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:07,306 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2023-11-12 01:02:07,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:07,306 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2023-11-12 01:02:07,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 01:02:07,307 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:07,307 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:02:07,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 01:02:07,308 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-12 01:02:07,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:07,308 INFO L85 PathProgramCache]: Analyzing trace with hash -542473854, now seen corresponding path program 1 times [2023-11-12 01:02:07,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:02:07,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336056292] [2023-11-12 01:02:07,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:07,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:02:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:02:08,216 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:02:08,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336056292] [2023-11-12 01:02:08,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336056292] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:02:08,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652017336] [2023-11-12 01:02:08,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:08,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:02:08,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:02:08,221 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 01:02:08,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 01:02:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:08,406 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-12 01:02:08,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:02:08,480 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 01:02:08,487 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 01:02:08,601 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2023-11-12 01:02:08,619 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 47 [2023-11-12 01:02:08,631 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-12 01:02:08,653 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2023-11-12 01:02:08,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:08,661 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-12 01:02:08,668 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2023-11-12 01:02:08,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:08,674 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2023-11-12 01:02:08,683 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-11-12 01:02:08,715 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2023-11-12 01:02:08,726 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 56 [2023-11-12 01:02:08,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:08,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:08,862 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-12 01:02:08,879 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 01:02:08,879 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-11-12 01:02:08,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:08,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:08,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:02:08,945 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 01:02:09,176 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:02:09,177 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 90 [2023-11-12 01:02:09,186 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 128 [2023-11-12 01:02:09,194 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 91 [2023-11-12 01:02:09,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:02:09,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652017336] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 01:02:09,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [114233163] [2023-11-12 01:02:09,718 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-12 01:02:09,718 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 01:02:09,722 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 01:02:09,727 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 01:02:09,727 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 01:02:10,219 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 01:02:13,315 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '881#(and (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) 8) 0)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) 8) 1)) (exists ((|v_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_41| (Array Int (Array Int Int))) (|v_#valid_33| (Array Int Int)) (|v_#memory_int_21| (Array Int (Array Int Int))) (|v_#memory_int_22| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc6#1.base_5| Int) (|v_#memory_$Pointer$.base_16| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.offset_42| Int) (|v_#length_18| (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.base_43| Int) (|v_#memory_$Pointer$.offset_36| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_16| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_21| (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_43|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|) (store (select |v_#memory_int_21| (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_43|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_42|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|) 8) 2))) (<= (+ |v_ULTIMATE.start_main_#t~malloc6#1.base_5| 1) |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_41| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_41| |v_ULTIMATE.start_main_~x~0#1.base_43|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_42|) (select (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_42|)))) |v_#memory_$Pointer$.base_16|) (= (store |v_#memory_$Pointer$.offset_36| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_36| |v_ULTIMATE.start_main_~x~0#1.base_43|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_42|) (select (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_42|)))) |v_#memory_$Pointer$.offset_16|) (= (store (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_43|)) (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_43|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|) (store (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_43|)) (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_43|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_42|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|) 8) (select (select |#memory_$Pointer$.base| (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_43|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_42|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|) 8)))) |#memory_$Pointer$.base|) (not (= |v_ULTIMATE.start_main_#t~malloc6#1.base_5| 0)) (= (store |v_#valid_33| |v_ULTIMATE.start_main_#t~malloc6#1.base_5| 1) |#valid|) (= (store |v_#length_18| |v_ULTIMATE.start_main_#t~malloc6#1.base_5| 12) |#length|) (= |v_#memory_int_22| (store |v_#memory_int_84| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (store (select |v_#memory_int_84| |v_ULTIMATE.start_main_~x~0#1.base_43|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_42|) 1) |v_ULTIMATE.start_main_~x~0#1.offset_42| (select (select |v_#memory_int_22| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|)))) (= (select |v_#valid_33| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 0) (= |#memory_$Pointer$.offset| (store (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_42|)) (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_43|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|) (store (select (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_42|)) (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_43|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_42|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|) 8) (select (select |#memory_$Pointer$.offset| (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_43|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_42|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|) 8))))) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 (select (select |v_#memory_int_21| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4)))))))' at error location [2023-11-12 01:02:13,316 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 01:02:13,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 01:02:13,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-12 01:02:13,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187357899] [2023-11-12 01:02:13,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 01:02:13,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 01:02:13,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:02:13,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 01:02:13,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2023-11-12 01:02:13,318 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:13,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:13,715 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2023-11-12 01:02:13,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 01:02:13,716 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 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 15 [2023-11-12 01:02:13,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:13,717 INFO L225 Difference]: With dead ends: 57 [2023-11-12 01:02:13,717 INFO L226 Difference]: Without dead ends: 55 [2023-11-12 01:02:13,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2023-11-12 01:02:13,718 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 50 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:13,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 179 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 01:02:13,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-12 01:02:13,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2023-11-12 01:02:13,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:13,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2023-11-12 01:02:13,728 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 15 [2023-11-12 01:02:13,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:13,728 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2023-11-12 01:02:13,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:13,728 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2023-11-12 01:02:13,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-12 01:02:13,729 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:13,730 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:02:13,742 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 01:02:13,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:02:13,942 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-12 01:02:13,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:13,943 INFO L85 PathProgramCache]: Analyzing trace with hash 98027970, now seen corresponding path program 1 times [2023-11-12 01:02:13,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:02:13,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613381509] [2023-11-12 01:02:13,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:13,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:02:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:14,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:02:14,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:02:14,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613381509] [2023-11-12 01:02:14,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613381509] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:02:14,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558889164] [2023-11-12 01:02:14,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:14,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:02:14,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:02:14,790 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 01:02:14,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 01:02:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:14,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-12 01:02:14,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:02:14,952 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 01:02:14,962 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 01:02:15,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:15,019 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-11-12 01:02:15,027 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2023-11-12 01:02:15,031 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-11-12 01:02:15,035 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-12 01:02:15,050 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 01:02:15,053 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-12 01:02:15,081 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-12 01:02:15,082 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-12 01:02:15,116 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-12 01:02:15,217 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 56 [2023-11-12 01:02:15,225 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 60 [2023-11-12 01:02:15,234 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 50 [2023-11-12 01:02:15,243 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 58 [2023-11-12 01:02:15,259 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 56 [2023-11-12 01:02:15,266 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 75 [2023-11-12 01:02:15,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:15,278 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-12 01:02:15,288 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 01:02:15,292 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-11-12 01:02:15,301 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 62 [2023-11-12 01:02:15,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:02:15,353 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 01:02:15,373 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:02:15,374 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-11-12 01:02:15,378 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 54 [2023-11-12 01:02:15,382 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2023-11-12 01:02:15,569 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:02:15,570 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 115 [2023-11-12 01:02:15,576 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 237 treesize of output 177 [2023-11-12 01:02:15,582 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 128 [2023-11-12 01:02:15,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:02:15,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558889164] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 01:02:15,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [943703863] [2023-11-12 01:02:15,904 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-12 01:02:15,904 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 01:02:15,905 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 01:02:15,905 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 01:02:15,905 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 01:02:16,341 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 01:02:20,243 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1155#(and (<= 1 |#StackHeapBarrier|) (not (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)))) (not (= |ULTIMATE.start_main_~head~0#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.offset|) (exists ((|v_#memory_int_21| (Array Int (Array Int Int))) (|v_#valid_42| (Array Int Int)) (|v_#memory_int_22| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc6#1.base_5| Int) (|v_#memory_$Pointer$.base_51| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.offset_50| Int) (|v_#memory_$Pointer$.base_16| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.base_52| Int) (|v_#length_25| (Array Int Int)) (|v_#memory_$Pointer$.offset_45| (Array Int (Array Int Int))) (|v_#memory_int_110| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_16| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_51| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_51| |v_ULTIMATE.start_main_~x~0#1.base_52|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_50|) (select (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_50|)))) |v_#memory_$Pointer$.base_16|) (= (store |v_#memory_int_110| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (store (select |v_#memory_int_110| |v_ULTIMATE.start_main_~x~0#1.base_52|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_50|) 1) |v_ULTIMATE.start_main_~x~0#1.offset_50| (select (select |v_#memory_int_22| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|))) |v_#memory_int_22|) (<= (+ |v_ULTIMATE.start_main_#t~malloc6#1.base_5| 1) |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.offset_45| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_45| |v_ULTIMATE.start_main_~x~0#1.base_52|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_50|) (select (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_50|)))) |v_#memory_$Pointer$.offset_16|) (= |#memory_$Pointer$.offset| (store (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_50|)) (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_52|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|) (store (select (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_50|)) (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_52|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_50|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|) 8) (select (select |#memory_$Pointer$.offset| (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_52|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_50|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|) 8))))) (= (select |v_#valid_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 0) (not (= |v_ULTIMATE.start_main_#t~malloc6#1.base_5| 0)) (= (store |v_#valid_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5| 1) |#valid|) (= |#memory_$Pointer$.base| (store (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_52|)) (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_52|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|) (store (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_52|)) (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_52|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_50|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|) 8) (select (select |#memory_$Pointer$.base| (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_52|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_50|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|) 8))))) (= |#memory_int| (store |v_#memory_int_21| (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_52|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|) (store (select |v_#memory_int_21| (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_52|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_50|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|) 8) 2))) (= |#length| (store |v_#length_25| |v_ULTIMATE.start_main_#t~malloc6#1.base_5| 12)) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 (select (select |v_#memory_int_21| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4)))))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~head~0#1.base|) 8) 1))' at error location [2023-11-12 01:02:20,243 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 01:02:20,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 01:02:20,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-12 01:02:20,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623612461] [2023-11-12 01:02:20,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 01:02:20,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-12 01:02:20,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:02:20,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-12 01:02:20,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=432, Unknown=1, NotChecked=0, Total=506 [2023-11-12 01:02:20,246 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:20,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:20,581 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2023-11-12 01:02:20,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 01:02:20,589 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-12 01:02:20,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:20,592 INFO L225 Difference]: With dead ends: 67 [2023-11-12 01:02:20,593 INFO L226 Difference]: Without dead ends: 51 [2023-11-12 01:02:20,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=98, Invalid=551, Unknown=1, NotChecked=0, Total=650 [2023-11-12 01:02:20,596 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 30 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:20,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 164 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 01:02:20,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-12 01:02:20,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2023-11-12 01:02:20,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:20,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2023-11-12 01:02:20,604 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 19 [2023-11-12 01:02:20,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:20,604 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2023-11-12 01:02:20,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:20,605 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2023-11-12 01:02:20,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 01:02:20,605 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:20,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:02:20,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 01:02:20,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:02:20,812 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-12 01:02:20,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:20,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1598318378, now seen corresponding path program 1 times [2023-11-12 01:02:20,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:02:20,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661641330] [2023-11-12 01:02:20,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:20,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:02:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:20,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:02:20,888 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:02:20,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661641330] [2023-11-12 01:02:20,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661641330] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:02:20,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:02:20,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 01:02:20,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317959011] [2023-11-12 01:02:20,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:02:20,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 01:02:20,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:02:20,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 01:02:20,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 01:02:20,891 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:20,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:20,976 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2023-11-12 01:02:20,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 01:02:20,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-12 01:02:20,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:20,977 INFO L225 Difference]: With dead ends: 49 [2023-11-12 01:02:20,977 INFO L226 Difference]: Without dead ends: 30 [2023-11-12 01:02:20,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 01:02:20,978 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:20,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 88 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 01:02:20,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-12 01:02:20,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-12 01:02:20,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:20,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2023-11-12 01:02:20,983 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 21 [2023-11-12 01:02:20,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:20,983 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2023-11-12 01:02:20,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:20,983 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2023-11-12 01:02:20,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 01:02:20,988 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:20,988 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:02:20,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 01:02:20,988 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-12 01:02:20,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:20,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2016055281, now seen corresponding path program 1 times [2023-11-12 01:02:20,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:02:20,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568316916] [2023-11-12 01:02:20,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:20,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:02:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:21,968 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:02:21,968 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:02:21,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568316916] [2023-11-12 01:02:21,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568316916] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:02:21,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126098735] [2023-11-12 01:02:21,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:21,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:02:21,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:02:21,970 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 01:02:21,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 01:02:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:22,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-12 01:02:22,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:02:22,150 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 01:02:22,200 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2023-11-12 01:02:22,218 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 01:02:22,218 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-12 01:02:22,242 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-12 01:02:22,244 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-12 01:02:22,258 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-11-12 01:02:22,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:22,265 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 01:02:22,275 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:02:22,301 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-12 01:02:22,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:22,459 INFO L322 Elim1Store]: treesize reduction 163, result has 0.6 percent of original size [2023-11-12 01:02:22,459 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 548 treesize of output 428 [2023-11-12 01:02:22,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:22,573 INFO L322 Elim1Store]: treesize reduction 128, result has 22.0 percent of original size [2023-11-12 01:02:22,574 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 540 treesize of output 455 [2023-11-12 01:02:22,597 INFO L322 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-11-12 01:02:22,597 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2023-11-12 01:02:22,605 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 89 [2023-11-12 01:02:22,622 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 42 [2023-11-12 01:02:22,652 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no need to replace index [2023-11-12 01:02:22,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2061797983] [2023-11-12 01:02:22,654 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-12 01:02:22,654 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 01:02:22,655 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 01:02:22,655 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 01:02:22,655 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 01:02:22,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 01:02:22,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-12 01:02:22,882 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Script currently locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@200b3478 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertScriptNotLocked(ManagedScript.java:109) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:282) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminateLight(PartialQuantifierElimination.java:62) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$TermDomainOperationProviderWithLightElimination.newQuantifier(SymbolicTools.java:284) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$TermDomainOperationProviderWithLightElimination.projectExistentially(SymbolicTools.java:270) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:117) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2023-11-12 01:02:22,890 INFO L158 Benchmark]: Toolchain (without parser) took 20142.86ms. Allocated memory was 155.2MB in the beginning and 270.5MB in the end (delta: 115.3MB). Free memory was 118.6MB in the beginning and 172.8MB in the end (delta: -54.3MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. [2023-11-12 01:02:22,891 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 119.5MB. Free memory was 89.3MB in the beginning and 89.2MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 01:02:22,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 659.96ms. Allocated memory is still 155.2MB. Free memory was 118.6MB in the beginning and 116.7MB in the end (delta: 1.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-12 01:02:22,891 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.28ms. Allocated memory is still 155.2MB. Free memory was 116.7MB in the beginning and 114.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 01:02:22,892 INFO L158 Benchmark]: Boogie Preprocessor took 58.97ms. Allocated memory is still 155.2MB. Free memory was 114.7MB in the beginning and 113.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 01:02:22,892 INFO L158 Benchmark]: RCFGBuilder took 544.76ms. Allocated memory is still 155.2MB. Free memory was 113.4MB in the beginning and 94.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-12 01:02:22,892 INFO L158 Benchmark]: TraceAbstraction took 18801.02ms. Allocated memory was 155.2MB in the beginning and 270.5MB in the end (delta: 115.3MB). Free memory was 93.7MB in the beginning and 172.8MB in the end (delta: -79.1MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2023-11-12 01:02:22,895 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.28ms. Allocated memory is still 119.5MB. Free memory was 89.3MB in the beginning and 89.2MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 659.96ms. Allocated memory is still 155.2MB. Free memory was 118.6MB in the beginning and 116.7MB in the end (delta: 1.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.28ms. Allocated memory is still 155.2MB. Free memory was 116.7MB in the beginning and 114.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.97ms. Allocated memory is still 155.2MB. Free memory was 114.7MB in the beginning and 113.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 544.76ms. Allocated memory is still 155.2MB. Free memory was 113.4MB in the beginning and 94.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 18801.02ms. Allocated memory was 155.2MB in the beginning and 270.5MB in the end (delta: 115.3MB). Free memory was 93.7MB in the beginning and 172.8MB in the end (delta: -79.1MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Script currently locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@200b3478 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Script currently locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@200b3478: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertScriptNotLocked(ManagedScript.java:109) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-12 01:02:22,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-token-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 01:02:25,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 01:02:25,711 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-11-12 01:02:25,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 01:02:25,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 01:02:25,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 01:02:25,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 01:02:25,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 01:02:25,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 01:02:25,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 01:02:25,780 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 01:02:25,780 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 01:02:25,781 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 01:02:25,783 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 01:02:25,784 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 01:02:25,784 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 01:02:25,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 01:02:25,786 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 01:02:25,787 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 01:02:25,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 01:02:25,788 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 01:02:25,788 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 01:02:25,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 01:02:25,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 01:02:25,790 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 01:02:25,790 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-12 01:02:25,791 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-12 01:02:25,791 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 01:02:25,792 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 01:02:25,792 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 01:02:25,794 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 01:02:25,794 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 01:02:25,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 01:02:25,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 01:02:25,795 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 01:02:25,796 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 01:02:25,796 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 01:02:25,796 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-11-12 01:02:25,796 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-12 01:02:25,797 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 01:02:25,798 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 01:02:25,798 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 01:02:25,799 INFO L153 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2023-11-12 01:02:26,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 01:02:26,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 01:02:26,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 01:02:26,343 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 01:02:26,344 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 01:02:26,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/forester-heap/dll-token-1.i [2023-11-12 01:02:29,737 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 01:02:30,119 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 01:02:30,120 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i [2023-11-12 01:02:30,144 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/data/0fcd1048e/0073403b69f34b0bbaa9ce2eb018e06f/FLAG25b2d918c [2023-11-12 01:02:30,166 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/data/0fcd1048e/0073403b69f34b0bbaa9ce2eb018e06f [2023-11-12 01:02:30,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 01:02:30,170 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 01:02:30,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 01:02:30,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 01:02:30,177 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 01:02:30,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:02:30" (1/1) ... [2023-11-12 01:02:30,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67c5084c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:30, skipping insertion in model container [2023-11-12 01:02:30,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:02:30" (1/1) ... [2023-11-12 01:02:30,230 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 01:02:30,556 WARN L240 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_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2023-11-12 01:02:30,575 WARN L240 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_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2023-11-12 01:02:30,578 WARN L240 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_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2023-11-12 01:02:30,580 WARN L240 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_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2023-11-12 01:02:30,583 WARN L240 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_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2023-11-12 01:02:30,586 WARN L240 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_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2023-11-12 01:02:30,595 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 01:02:30,616 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 01:02:30,690 WARN L240 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_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2023-11-12 01:02:30,703 WARN L240 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_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2023-11-12 01:02:30,705 WARN L240 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_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2023-11-12 01:02:30,708 WARN L240 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_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2023-11-12 01:02:30,710 WARN L240 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_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2023-11-12 01:02:30,715 WARN L240 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_162a65ef-9819-47e3-99be-5437a25b2e9d/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2023-11-12 01:02:30,734 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 01:02:30,781 INFO L206 MainTranslator]: Completed translation [2023-11-12 01:02:30,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:30 WrapperNode [2023-11-12 01:02:30,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 01:02:30,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 01:02:30,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 01:02:30,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 01:02:30,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:30" (1/1) ... [2023-11-12 01:02:30,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:30" (1/1) ... [2023-11-12 01:02:30,865 INFO L138 Inliner]: procedures = 122, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 130 [2023-11-12 01:02:30,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 01:02:30,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 01:02:30,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 01:02:30,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 01:02:30,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:30" (1/1) ... [2023-11-12 01:02:30,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:30" (1/1) ... [2023-11-12 01:02:30,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:30" (1/1) ... [2023-11-12 01:02:30,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:30" (1/1) ... [2023-11-12 01:02:30,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:30" (1/1) ... [2023-11-12 01:02:30,923 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:30" (1/1) ... [2023-11-12 01:02:30,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:30" (1/1) ... [2023-11-12 01:02:30,933 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:30" (1/1) ... [2023-11-12 01:02:30,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 01:02:30,944 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 01:02:30,954 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 01:02:30,955 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 01:02:30,956 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:30" (1/1) ... [2023-11-12 01:02:30,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 01:02:30,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:02:30,986 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 01:02:30,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 01:02:31,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-12 01:02:31,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 01:02:31,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 01:02:31,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 01:02:31,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 01:02:31,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 01:02:31,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-12 01:02:31,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-12 01:02:31,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 01:02:31,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 01:02:31,186 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 01:02:31,189 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 01:02:32,357 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 01:02:32,363 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 01:02:32,364 INFO L302 CfgBuilder]: Removed 15 assume(true) statements. [2023-11-12 01:02:32,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:02:32 BoogieIcfgContainer [2023-11-12 01:02:32,367 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 01:02:32,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 01:02:32,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 01:02:32,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 01:02:32,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:02:30" (1/3) ... [2023-11-12 01:02:32,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee2fe63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:02:32, skipping insertion in model container [2023-11-12 01:02:32,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:30" (2/3) ... [2023-11-12 01:02:32,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee2fe63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:02:32, skipping insertion in model container [2023-11-12 01:02:32,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:02:32" (3/3) ... [2023-11-12 01:02:32,377 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2023-11-12 01:02:32,401 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 01:02:32,401 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-12 01:02:32,486 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 01:02:32,493 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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;@32334387, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 01:02:32,493 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-12 01:02:32,498 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 43 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) [2023-11-12 01:02:32,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 01:02:32,506 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:32,507 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 01:02:32,508 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-12 01:02:32,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:32,514 INFO L85 PathProgramCache]: Analyzing trace with hash 890337990, now seen corresponding path program 1 times [2023-11-12 01:02:32,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 01:02:32,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503755549] [2023-11-12 01:02:32,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:32,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 01:02:32,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 01:02:32,544 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 01:02:32,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-12 01:02:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:32,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-12 01:02:32,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:02:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:02:32,775 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 01:02:32,775 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 01:02:32,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503755549] [2023-11-12 01:02:32,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503755549] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:02:32,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:02:32,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 01:02:32,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705123979] [2023-11-12 01:02:32,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:02:32,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 01:02:32,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 01:02:32,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 01:02:32,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 01:02:32,812 INFO L87 Difference]: Start difference. First operand has 44 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 43 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:32,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:32,831 INFO L93 Difference]: Finished difference Result 86 states and 132 transitions. [2023-11-12 01:02:32,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 01:02:32,833 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2023-11-12 01:02:32,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:32,840 INFO L225 Difference]: With dead ends: 86 [2023-11-12 01:02:32,840 INFO L226 Difference]: Without dead ends: 39 [2023-11-12 01:02:32,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 01:02:32,846 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:32,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 01:02:32,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-12 01:02:32,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-11-12 01:02:32,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:32,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2023-11-12 01:02:32,879 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 6 [2023-11-12 01:02:32,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:32,879 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2023-11-12 01:02:32,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2023-11-12 01:02:32,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 01:02:32,880 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:32,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 01:02:32,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-12 01:02:33,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 01:02:33,095 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-12 01:02:33,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:33,095 INFO L85 PathProgramCache]: Analyzing trace with hash 889571369, now seen corresponding path program 1 times [2023-11-12 01:02:33,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 01:02:33,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [124637988] [2023-11-12 01:02:33,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:33,097 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 01:02:33,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 01:02:33,098 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 01:02:33,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-12 01:02:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:33,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-12 01:02:33,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:02:33,322 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-12 01:02:33,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:33,445 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-12 01:02:33,446 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-12 01:02:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:02:33,465 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 01:02:33,466 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 01:02:33,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [124637988] [2023-11-12 01:02:33,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [124637988] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:02:33,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:02:33,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 01:02:33,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334782705] [2023-11-12 01:02:33,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:02:33,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 01:02:33,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 01:02:33,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 01:02:33,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 01:02:33,472 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:35,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:35,397 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2023-11-12 01:02:35,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 01:02:35,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2023-11-12 01:02:35,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:35,399 INFO L225 Difference]: With dead ends: 39 [2023-11-12 01:02:35,400 INFO L226 Difference]: Without dead ends: 37 [2023-11-12 01:02:35,400 INFO L412 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 [2023-11-12 01:02:35,402 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:35,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-12 01:02:35,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-12 01:02:35,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-12 01:02:35,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:35,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2023-11-12 01:02:35,414 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 6 [2023-11-12 01:02:35,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:35,415 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2023-11-12 01:02:35,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:35,420 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2023-11-12 01:02:35,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 01:02:35,422 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:35,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:02:35,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-12 01:02:35,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 01:02:35,637 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-12 01:02:35,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:35,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1806865149, now seen corresponding path program 1 times [2023-11-12 01:02:35,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 01:02:35,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533005338] [2023-11-12 01:02:35,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:35,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 01:02:35,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 01:02:35,641 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 01:02:35,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-12 01:02:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:35,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-12 01:02:35,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:02:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:02:35,806 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 01:02:35,807 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 01:02:35,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533005338] [2023-11-12 01:02:35,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533005338] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:02:35,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:02:35,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 01:02:35,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704000949] [2023-11-12 01:02:35,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:02:35,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 01:02:35,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 01:02:35,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 01:02:35,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 01:02:35,812 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:36,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:36,153 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2023-11-12 01:02:36,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 01:02:36,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-11-12 01:02:36,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:36,157 INFO L225 Difference]: With dead ends: 63 [2023-11-12 01:02:36,157 INFO L226 Difference]: Without dead ends: 61 [2023-11-12 01:02:36,158 INFO L412 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 [2023-11-12 01:02:36,159 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 76 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:36,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 48 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 01:02:36,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-12 01:02:36,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 35. [2023-11-12 01:02:36,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 34 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2023-11-12 01:02:36,175 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 7 [2023-11-12 01:02:36,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:36,176 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2023-11-12 01:02:36,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:36,177 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2023-11-12 01:02:36,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 01:02:36,178 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:36,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:02:36,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-12 01:02:36,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 01:02:36,394 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-12 01:02:36,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:36,394 INFO L85 PathProgramCache]: Analyzing trace with hash -913382283, now seen corresponding path program 1 times [2023-11-12 01:02:36,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 01:02:36,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886886669] [2023-11-12 01:02:36,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:36,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 01:02:36,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 01:02:36,397 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 01:02:36,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-12 01:02:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:36,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 01:02:36,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:02:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:02:36,641 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 01:02:36,641 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 01:02:36,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886886669] [2023-11-12 01:02:36,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [886886669] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:02:36,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:02:36,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 01:02:36,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668679388] [2023-11-12 01:02:36,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:02:36,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 01:02:36,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 01:02:36,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 01:02:36,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 01:02:36,647 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:37,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:37,250 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2023-11-12 01:02:37,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 01:02:37,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-12 01:02:37,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:37,252 INFO L225 Difference]: With dead ends: 35 [2023-11-12 01:02:37,252 INFO L226 Difference]: Without dead ends: 33 [2023-11-12 01:02:37,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 01:02:37,254 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:37,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 90 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 01:02:37,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-12 01:02:37,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-12 01:02:37,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:37,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2023-11-12 01:02:37,269 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 12 [2023-11-12 01:02:37,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:37,269 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2023-11-12 01:02:37,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:37,270 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2023-11-12 01:02:37,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 01:02:37,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:37,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:02:37,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-12 01:02:37,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 01:02:37,492 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-12 01:02:37,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:37,492 INFO L85 PathProgramCache]: Analyzing trace with hash -913344547, now seen corresponding path program 1 times [2023-11-12 01:02:37,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 01:02:37,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807033693] [2023-11-12 01:02:37,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:37,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 01:02:37,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 01:02:37,495 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 01:02:37,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-12 01:02:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:37,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-12 01:02:37,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:02:37,689 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-12 01:02:37,791 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-12 01:02:37,803 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 53 [2023-11-12 01:02:37,815 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 76 [2023-11-12 01:02:37,830 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2023-11-12 01:02:37,856 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2023-11-12 01:02:37,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:37,883 INFO L322 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2023-11-12 01:02:37,883 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 56 [2023-11-12 01:02:37,920 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-12 01:02:37,921 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-12 01:02:38,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:02:38,108 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 01:02:38,108 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 01:02:38,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807033693] [2023-11-12 01:02:38,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1807033693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:02:38,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:02:38,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 01:02:38,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609198079] [2023-11-12 01:02:38,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:02:38,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 01:02:38,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 01:02:38,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 01:02:38,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 01:02:38,118 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:40,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:40,845 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2023-11-12 01:02:40,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 01:02:40,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-12 01:02:40,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:40,847 INFO L225 Difference]: With dead ends: 68 [2023-11-12 01:02:40,847 INFO L226 Difference]: Without dead ends: 44 [2023-11-12 01:02:40,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 01:02:40,848 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:40,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 92 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-12 01:02:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-11-12 01:02:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2023-11-12 01:02:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2023-11-12 01:02:40,868 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 12 [2023-11-12 01:02:40,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:40,869 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2023-11-12 01:02:40,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:40,869 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2023-11-12 01:02:40,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 01:02:40,870 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:40,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:02:40,891 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-12 01:02:41,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 01:02:41,085 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-12 01:02:41,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:41,086 INFO L85 PathProgramCache]: Analyzing trace with hash -313255267, now seen corresponding path program 1 times [2023-11-12 01:02:41,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 01:02:41,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259100120] [2023-11-12 01:02:41,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:41,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 01:02:41,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 01:02:41,088 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 01:02:41,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-12 01:02:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:41,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-12 01:02:41,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:02:41,277 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-12 01:02:41,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:41,392 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 134 [2023-11-12 01:02:41,526 INFO L322 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2023-11-12 01:02:41,526 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 298 treesize of output 285 [2023-11-12 01:02:41,701 INFO L322 Elim1Store]: treesize reduction 62, result has 23.5 percent of original size [2023-11-12 01:02:41,701 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 167 [2023-11-12 01:02:41,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:41,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:41,726 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 115 [2023-11-12 01:02:41,747 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 133 [2023-11-12 01:02:41,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:41,927 INFO L322 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2023-11-12 01:02:41,928 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 107 [2023-11-12 01:02:41,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:42,008 INFO L322 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-11-12 01:02:42,008 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 76 [2023-11-12 01:02:42,104 INFO L322 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-12 01:02:42,104 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2023-11-12 01:02:42,201 INFO L322 Elim1Store]: treesize reduction 21, result has 36.4 percent of original size [2023-11-12 01:02:42,202 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 30 [2023-11-12 01:02:42,251 INFO L322 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-11-12 01:02:42,251 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 5 [2023-11-12 01:02:42,286 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-11-12 01:02:42,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:42,406 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 150 [2023-11-12 01:02:42,423 INFO L322 Elim1Store]: treesize reduction 101, result has 1.0 percent of original size [2023-11-12 01:02:42,424 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 341 treesize of output 311 [2023-11-12 01:02:42,442 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:02:42,445 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-12 01:02:43,217 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 115 [2023-11-12 01:02:43,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:43,247 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:02:43,248 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 90 [2023-11-12 01:02:43,269 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 66 [2023-11-12 01:02:43,281 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 64 [2023-11-12 01:02:43,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:02:43,351 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 01:02:43,351 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 01:02:43,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259100120] [2023-11-12 01:02:43,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259100120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:02:43,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:02:43,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 01:02:43,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224279084] [2023-11-12 01:02:43,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:02:43,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 01:02:43,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 01:02:43,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 01:02:43,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=20, Unknown=1, NotChecked=0, Total=30 [2023-11-12 01:02:43,354 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:46,077 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (_ bv0 32))) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)) (not (= .cse0 |c_ULTIMATE.start_main_~x~0#1.base|)) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_DerPreprocessor_3) |c_ULTIMATE.start_main_~x~0#1.base| .cse1) .cse0) (_ bv4 32)) (_ bv0 32))) (exists ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_4) .cse0 (select |c_#memory_$Pointer$.offset| .cse0)) |c_ULTIMATE.start_main_~x~0#1.base|) (_ bv0 32)) (_ bv0 32))) (exists ((v_arrayElimCell_10 (_ BitVec 32)) (v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_DerPreprocessor_3) |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_4) v_arrayElimCell_10 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_10)))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (select .cse4 .cse0))) (and (= (select .cse2 (_ bv4 32)) (_ bv0 32)) (= .cse3 v_DerPreprocessor_4) (= (select .cse3 (_ bv0 32)) (_ bv0 32)) (= .cse2 v_DerPreprocessor_3)))))) (= (_ bv2 32) (select (select |c_#memory_int| .cse0) (_ bv8 32))) (= (select .cse1 (_ bv0 32)) (_ bv0 32)))) is different from true [2023-11-12 01:02:46,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:46,583 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2023-11-12 01:02:46,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 01:02:46,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2023-11-12 01:02:46,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:46,584 INFO L225 Difference]: With dead ends: 50 [2023-11-12 01:02:46,584 INFO L226 Difference]: Without dead ends: 48 [2023-11-12 01:02:46,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=28, Unknown=3, NotChecked=10, Total=56 [2023-11-12 01:02:46,586 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:46,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 107 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 4 Unknown, 4 Unchecked, 3.2s Time] [2023-11-12 01:02:46,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-12 01:02:46,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2023-11-12 01:02:46,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:46,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2023-11-12 01:02:46,613 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 16 [2023-11-12 01:02:46,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:46,613 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2023-11-12 01:02:46,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:46,614 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2023-11-12 01:02:46,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 01:02:46,614 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:46,615 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:02:46,637 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-12 01:02:46,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 01:02:46,829 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-12 01:02:46,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:46,829 INFO L85 PathProgramCache]: Analyzing trace with hash -648614522, now seen corresponding path program 1 times [2023-11-12 01:02:46,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 01:02:46,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666410523] [2023-11-12 01:02:46,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:46,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 01:02:46,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 01:02:46,841 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 01:02:46,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-12 01:02:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:47,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-12 01:02:47,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:02:47,129 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-12 01:02:47,139 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 01:02:47,239 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-11-12 01:02:47,251 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2023-11-12 01:02:47,283 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2023-11-12 01:02:47,295 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 47 [2023-11-12 01:02:47,320 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2023-11-12 01:02:47,331 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-12 01:02:47,337 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2023-11-12 01:02:47,343 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2023-11-12 01:02:47,359 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-11-12 01:02:47,376 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2023-11-12 01:02:47,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:47,387 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-12 01:02:47,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:47,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:47,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:47,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:47,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:47,650 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-12 01:02:47,678 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-12 01:02:47,679 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-11-12 01:02:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:02:47,773 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 01:02:48,166 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:02:48,167 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 90 [2023-11-12 01:02:48,178 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 128 [2023-11-12 01:02:48,189 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 91 [2023-11-12 01:02:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:02:49,244 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 01:02:49,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666410523] [2023-11-12 01:02:49,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666410523] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 01:02:49,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1525034535] [2023-11-12 01:02:49,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:49,245 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-12 01:02:49,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/cvc4 [2023-11-12 01:02:49,248 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-12 01:02:49,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162a65ef-9819-47e3-99be-5437a25b2e9d/bin/utaipan-verify-NcY6lQBIFX/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-11-12 01:02:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:49,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-12 01:02:49,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:02:49,547 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-12 01:02:49,557 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 01:02:49,626 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2023-11-12 01:02:49,630 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-11-12 01:02:49,635 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-12 01:02:49,668 INFO L322 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-12 01:02:49,669 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-12 01:02:49,689 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-11-12 01:02:49,698 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 01:02:49,719 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-12 01:02:49,865 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 56 [2023-11-12 01:02:49,877 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 75 [2023-11-12 01:02:49,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:49,897 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-12 01:02:49,926 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-12 01:02:49,927 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-11-12 01:02:49,958 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 62 [2023-11-12 01:02:49,981 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 50 [2023-11-12 01:02:49,992 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 58