./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68b918b5051efa1a4363a7cd528e42e31cd4f687fef5116849d37b2131e9c46c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:02:08,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:02:08,401 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 05:02:08,407 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:02:08,409 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:02:08,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:02:08,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:02:08,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:02:08,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:02:08,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:02:08,444 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:02:08,445 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:02:08,445 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:02:08,446 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:02:08,446 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:02:08,447 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:02:08,449 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:02:08,449 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:02:08,452 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:02:08,453 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:02:08,453 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:02:08,454 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:02:08,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 05:02:08,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 05:02:08,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:02:08,459 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:02:08,459 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:02:08,460 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:02:08,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:02:08,460 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 05:02:08,462 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 05:02:08,463 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 05:02:08,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:02:08,464 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 05:02:08,464 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:02:08,465 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 05:02:08,466 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:02:08,466 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:02:08,467 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:02:08,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:02:08,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:02:08,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:02:08,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:02:08,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:02:08,469 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:02:08,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:02:08,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:02:08,470 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:02:08,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:02:08,471 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_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 68b918b5051efa1a4363a7cd528e42e31cd4f687fef5116849d37b2131e9c46c [2024-11-09 05:02:08,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:02:08,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:02:08,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:02:08,833 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:02:08,833 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:02:08,835 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i Unable to find full path for "g++" [2024-11-09 05:02:11,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:02:11,690 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:02:11,693 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i [2024-11-09 05:02:11,713 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/data/5d0f1f22a/3a9ef04e3acf45d38d7b68e4b8007da5/FLAG6c7ccf9e0 [2024-11-09 05:02:11,739 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/data/5d0f1f22a/3a9ef04e3acf45d38d7b68e4b8007da5 [2024-11-09 05:02:11,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:02:11,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:02:11,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:02:11,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:02:11,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:02:11,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:02:11" (1/1) ... [2024-11-09 05:02:11,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ec6d8cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:11, skipping insertion in model container [2024-11-09 05:02:11,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:02:11" (1/1) ... [2024-11-09 05:02:11,853 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:02:12,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:02:12,596 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:02:12,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:02:12,864 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:02:12,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:12 WrapperNode [2024-11-09 05:02:12,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:02:12,867 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:02:12,867 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:02:12,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:02:12,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:12" (1/1) ... [2024-11-09 05:02:12,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:12" (1/1) ... [2024-11-09 05:02:12,959 INFO L138 Inliner]: procedures = 368, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2024-11-09 05:02:12,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:02:12,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:02:12,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:02:12,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:02:12,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:12" (1/1) ... [2024-11-09 05:02:12,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:12" (1/1) ... [2024-11-09 05:02:12,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:12" (1/1) ... [2024-11-09 05:02:12,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:12" (1/1) ... [2024-11-09 05:02:13,001 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:12" (1/1) ... [2024-11-09 05:02:13,006 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:12" (1/1) ... [2024-11-09 05:02:13,008 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:12" (1/1) ... [2024-11-09 05:02:13,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:12" (1/1) ... [2024-11-09 05:02:13,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:02:13,019 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:02:13,019 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:02:13,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:02:13,020 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:12" (1/1) ... [2024-11-09 05:02:13,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:02:13,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:02:13,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:02:13,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:02:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 05:02:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 05:02:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 05:02:13,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:02:13,104 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 05:02:13,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 05:02:13,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:02:13,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 05:02:13,107 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 05:02:13,107 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 05:02:13,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:02:13,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:02:13,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:02:13,109 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 05:02:13,300 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:02:13,303 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:02:13,747 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 05:02:13,747 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:02:14,065 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:02:14,066 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 05:02:14,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:02:14 BoogieIcfgContainer [2024-11-09 05:02:14,066 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:02:14,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:02:14,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:02:14,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:02:14,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:02:11" (1/3) ... [2024-11-09 05:02:14,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38258b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:02:14, skipping insertion in model container [2024-11-09 05:02:14,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:12" (2/3) ... [2024-11-09 05:02:14,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38258b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:02:14, skipping insertion in model container [2024-11-09 05:02:14,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:02:14" (3/3) ... [2024-11-09 05:02:14,080 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_02-list_nr.i [2024-11-09 05:02:14,101 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:02:14,101 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2024-11-09 05:02:14,101 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 05:02:14,191 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 05:02:14,266 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 51 transitions, 106 flow [2024-11-09 05:02:14,339 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 308 states, 233 states have (on average 2.4206008583690988) internal successors, (564), 307 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:14,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:02:14,393 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@5e193f6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:02:14,393 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2024-11-09 05:02:14,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 308 states, 233 states have (on average 2.4206008583690988) internal successors, (564), 307 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:14,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 05:02:14,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:14,413 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-09 05:02:14,414 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:14,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:14,422 INFO L85 PathProgramCache]: Analyzing trace with hash 11213, now seen corresponding path program 1 times [2024-11-09 05:02:14,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:02:14,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739468144] [2024-11-09 05:02:14,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:14,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:02:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:14,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:14,995 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:02:14,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739468144] [2024-11-09 05:02:14,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739468144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:14,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:14,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 05:02:14,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944907683] [2024-11-09 05:02:14,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:15,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:02:15,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:02:15,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:02:15,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:15,042 INFO L87 Difference]: Start difference. First operand has 308 states, 233 states have (on average 2.4206008583690988) internal successors, (564), 307 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:15,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:15,248 INFO L93 Difference]: Finished difference Result 308 states and 564 transitions. [2024-11-09 05:02:15,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:02:15,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2024-11-09 05:02:15,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:15,278 INFO L225 Difference]: With dead ends: 308 [2024-11-09 05:02:15,279 INFO L226 Difference]: Without dead ends: 304 [2024-11-09 05:02:15,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:15,289 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:15,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 32 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:02:15,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-09 05:02:15,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2024-11-09 05:02:15,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 233 states have (on average 2.40343347639485) internal successors, (560), 303 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:15,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 560 transitions. [2024-11-09 05:02:15,389 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 560 transitions. Word has length 2 [2024-11-09 05:02:15,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:15,390 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 560 transitions. [2024-11-09 05:02:15,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:15,391 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 560 transitions. [2024-11-09 05:02:15,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 05:02:15,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:15,394 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-09 05:02:15,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:02:15,395 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:15,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:15,396 INFO L85 PathProgramCache]: Analyzing trace with hash 11214, now seen corresponding path program 1 times [2024-11-09 05:02:15,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:02:15,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309687192] [2024-11-09 05:02:15,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:15,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:02:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:15,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:15,657 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:02:15,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309687192] [2024-11-09 05:02:15,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309687192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:15,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:15,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 05:02:15,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467490113] [2024-11-09 05:02:15,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:15,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:02:15,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:02:15,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:02:15,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:15,663 INFO L87 Difference]: Start difference. First operand 304 states and 560 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:15,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:15,794 INFO L93 Difference]: Finished difference Result 304 states and 560 transitions. [2024-11-09 05:02:15,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:02:15,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2024-11-09 05:02:15,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:15,798 INFO L225 Difference]: With dead ends: 304 [2024-11-09 05:02:15,798 INFO L226 Difference]: Without dead ends: 300 [2024-11-09 05:02:15,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:15,800 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:15,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 33 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:02:15,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-09 05:02:15,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2024-11-09 05:02:15,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 233 states have (on average 2.3862660944206007) internal successors, (556), 299 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:15,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 556 transitions. [2024-11-09 05:02:15,862 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 556 transitions. Word has length 2 [2024-11-09 05:02:15,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:15,863 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 556 transitions. [2024-11-09 05:02:15,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:15,863 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 556 transitions. [2024-11-09 05:02:15,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 05:02:15,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:15,864 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 05:02:15,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 05:02:15,865 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:15,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:15,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1774899415, now seen corresponding path program 1 times [2024-11-09 05:02:15,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:02:15,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209202393] [2024-11-09 05:02:15,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:15,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:02:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:16,084 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:02:16,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209202393] [2024-11-09 05:02:16,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209202393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:16,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:16,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:02:16,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150006707] [2024-11-09 05:02:16,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:16,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:02:16,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:02:16,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:02:16,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:02:16,092 INFO L87 Difference]: Start difference. First operand 300 states and 556 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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) [2024-11-09 05:02:16,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:16,229 INFO L93 Difference]: Finished difference Result 300 states and 556 transitions. [2024-11-09 05:02:16,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:02:16,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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 [2024-11-09 05:02:16,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:16,233 INFO L225 Difference]: With dead ends: 300 [2024-11-09 05:02:16,233 INFO L226 Difference]: Without dead ends: 252 [2024-11-09 05:02:16,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:02:16,235 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 32 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:16,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 13 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:02:16,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-09 05:02:16,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2024-11-09 05:02:16,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 207 states have (on average 2.241545893719807) internal successors, (464), 251 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:16,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 464 transitions. [2024-11-09 05:02:16,254 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 464 transitions. Word has length 6 [2024-11-09 05:02:16,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:16,254 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 464 transitions. [2024-11-09 05:02:16,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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) [2024-11-09 05:02:16,255 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 464 transitions. [2024-11-09 05:02:16,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 05:02:16,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:16,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 05:02:16,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 05:02:16,257 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:16,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:16,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1774899416, now seen corresponding path program 1 times [2024-11-09 05:02:16,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:02:16,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244416063] [2024-11-09 05:02:16,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:16,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:02:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:16,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:02:16,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244416063] [2024-11-09 05:02:16,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244416063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:16,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:16,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:02:16,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360405260] [2024-11-09 05:02:16,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:16,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:02:16,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:02:16,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:02:16,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:02:16,568 INFO L87 Difference]: Start difference. First operand 252 states and 464 transitions. Second operand has 4 states, 3 states have (on average 2.0) 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) [2024-11-09 05:02:16,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:16,665 INFO L93 Difference]: Finished difference Result 252 states and 464 transitions. [2024-11-09 05:02:16,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:02:16,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) 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 [2024-11-09 05:02:16,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:16,668 INFO L225 Difference]: With dead ends: 252 [2024-11-09 05:02:16,669 INFO L226 Difference]: Without dead ends: 208 [2024-11-09 05:02:16,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:02:16,671 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:16,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 15 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:02:16,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-09 05:02:16,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-11-09 05:02:16,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 2.0994475138121547) internal successors, (380), 207 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:16,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 380 transitions. [2024-11-09 05:02:16,685 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 380 transitions. Word has length 6 [2024-11-09 05:02:16,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:16,686 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 380 transitions. [2024-11-09 05:02:16,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) 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) [2024-11-09 05:02:16,686 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 380 transitions. [2024-11-09 05:02:16,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 05:02:16,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:16,687 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:16,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 05:02:16,688 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:16,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:16,689 INFO L85 PathProgramCache]: Analyzing trace with hash 686521503, now seen corresponding path program 1 times [2024-11-09 05:02:16,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:02:16,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520583543] [2024-11-09 05:02:16,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:16,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:02:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:16,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:16,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:02:16,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520583543] [2024-11-09 05:02:16,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520583543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:16,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:16,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:02:16,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433300706] [2024-11-09 05:02:16,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:16,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:02:16,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:02:16,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:02:16,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:16,914 INFO L87 Difference]: Start difference. First operand 208 states and 380 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:17,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:17,010 INFO L93 Difference]: Finished difference Result 208 states and 380 transitions. [2024-11-09 05:02:17,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:02:17,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 05:02:17,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:17,013 INFO L225 Difference]: With dead ends: 208 [2024-11-09 05:02:17,013 INFO L226 Difference]: Without dead ends: 184 [2024-11-09 05:02:17,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:17,016 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:17,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 17 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:02:17,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-09 05:02:17,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-11-09 05:02:17,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 165 states have (on average 2.0242424242424244) internal successors, (334), 183 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:17,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 334 transitions. [2024-11-09 05:02:17,032 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 334 transitions. Word has length 9 [2024-11-09 05:02:17,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:17,037 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 334 transitions. [2024-11-09 05:02:17,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:17,037 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 334 transitions. [2024-11-09 05:02:17,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 05:02:17,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:17,038 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:17,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 05:02:17,038 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:17,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:17,039 INFO L85 PathProgramCache]: Analyzing trace with hash 686521504, now seen corresponding path program 1 times [2024-11-09 05:02:17,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:02:17,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976810951] [2024-11-09 05:02:17,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:17,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:02:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:17,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:17,326 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:02:17,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976810951] [2024-11-09 05:02:17,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976810951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:17,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:17,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:02:17,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591803691] [2024-11-09 05:02:17,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:17,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:02:17,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:02:17,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:02:17,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:17,328 INFO L87 Difference]: Start difference. First operand 184 states and 334 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:17,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:17,429 INFO L93 Difference]: Finished difference Result 184 states and 334 transitions. [2024-11-09 05:02:17,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:02:17,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 05:02:17,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:17,431 INFO L225 Difference]: With dead ends: 184 [2024-11-09 05:02:17,431 INFO L226 Difference]: Without dead ends: 160 [2024-11-09 05:02:17,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:17,433 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:17,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 19 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:02:17,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-09 05:02:17,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-11-09 05:02:17,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 149 states have (on average 1.9328859060402686) internal successors, (288), 159 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:17,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 288 transitions. [2024-11-09 05:02:17,439 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 288 transitions. Word has length 9 [2024-11-09 05:02:17,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:17,440 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 288 transitions. [2024-11-09 05:02:17,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:17,440 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 288 transitions. [2024-11-09 05:02:17,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 05:02:17,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:17,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:17,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 05:02:17,441 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:17,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:17,442 INFO L85 PathProgramCache]: Analyzing trace with hash -511232776, now seen corresponding path program 1 times [2024-11-09 05:02:17,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:02:17,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102652312] [2024-11-09 05:02:17,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:17,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:02:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:17,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:17,820 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:02:17,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102652312] [2024-11-09 05:02:17,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102652312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:17,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:17,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:02:17,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603617269] [2024-11-09 05:02:17,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:17,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:02:17,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:02:17,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:02:17,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:02:17,822 INFO L87 Difference]: Start difference. First operand 160 states and 288 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:18,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:18,002 INFO L93 Difference]: Finished difference Result 193 states and 351 transitions. [2024-11-09 05:02:18,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:02:18,003 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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 [2024-11-09 05:02:18,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:18,005 INFO L225 Difference]: With dead ends: 193 [2024-11-09 05:02:18,005 INFO L226 Difference]: Without dead ends: 180 [2024-11-09 05:02:18,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:02:18,006 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 35 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:18,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 15 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:02:18,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-09 05:02:18,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 169. [2024-11-09 05:02:18,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 158 states have (on average 2.0) internal successors, (316), 168 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:18,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 316 transitions. [2024-11-09 05:02:18,019 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 316 transitions. Word has length 12 [2024-11-09 05:02:18,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:18,019 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 316 transitions. [2024-11-09 05:02:18,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:18,020 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 316 transitions. [2024-11-09 05:02:18,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 05:02:18,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:18,021 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:18,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 05:02:18,022 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:18,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:18,023 INFO L85 PathProgramCache]: Analyzing trace with hash -511232775, now seen corresponding path program 1 times [2024-11-09 05:02:18,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:02:18,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947637796] [2024-11-09 05:02:18,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:18,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:02:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:18,514 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:02:18,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947637796] [2024-11-09 05:02:18,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947637796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:18,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:18,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:02:18,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907765773] [2024-11-09 05:02:18,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:18,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:02:18,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:02:18,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:02:18,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:02:18,517 INFO L87 Difference]: Start difference. First operand 169 states and 316 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:18,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:18,653 INFO L93 Difference]: Finished difference Result 224 states and 407 transitions. [2024-11-09 05:02:18,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:02:18,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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 [2024-11-09 05:02:18,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:18,655 INFO L225 Difference]: With dead ends: 224 [2024-11-09 05:02:18,655 INFO L226 Difference]: Without dead ends: 211 [2024-11-09 05:02:18,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:02:18,657 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 33 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:18,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 15 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:02:18,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-09 05:02:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 167. [2024-11-09 05:02:18,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 156 states have (on average 1.9294871794871795) internal successors, (301), 166 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:18,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 301 transitions. [2024-11-09 05:02:18,664 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 301 transitions. Word has length 12 [2024-11-09 05:02:18,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:18,665 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 301 transitions. [2024-11-09 05:02:18,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:18,665 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 301 transitions. [2024-11-09 05:02:18,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 05:02:18,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:18,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:18,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 05:02:18,666 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:18,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:18,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1782278327, now seen corresponding path program 1 times [2024-11-09 05:02:18,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:02:18,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834175378] [2024-11-09 05:02:18,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:18,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:02:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:19,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:19,242 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:02:19,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834175378] [2024-11-09 05:02:19,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834175378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:19,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:19,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 05:02:19,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500802151] [2024-11-09 05:02:19,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:19,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 05:02:19,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:02:19,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 05:02:19,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-09 05:02:19,245 INFO L87 Difference]: Start difference. First operand 167 states and 301 transitions. Second operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:19,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:19,580 INFO L93 Difference]: Finished difference Result 209 states and 375 transitions. [2024-11-09 05:02:19,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 05:02:19,581 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 05:02:19,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:19,583 INFO L225 Difference]: With dead ends: 209 [2024-11-09 05:02:19,583 INFO L226 Difference]: Without dead ends: 198 [2024-11-09 05:02:19,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-09 05:02:19,584 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 105 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:19,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 30 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:02:19,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-09 05:02:19,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 168. [2024-11-09 05:02:19,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 157 states have (on average 1.9617834394904459) internal successors, (308), 167 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 308 transitions. [2024-11-09 05:02:19,594 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 308 transitions. Word has length 14 [2024-11-09 05:02:19,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:19,595 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 308 transitions. [2024-11-09 05:02:19,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:19,595 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 308 transitions. [2024-11-09 05:02:19,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 05:02:19,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:19,596 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:19,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 05:02:19,596 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:19,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:19,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1782278328, now seen corresponding path program 1 times [2024-11-09 05:02:19,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:02:19,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875083957] [2024-11-09 05:02:19,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:19,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:02:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:20,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:20,357 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:02:20,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875083957] [2024-11-09 05:02:20,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875083957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:20,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:20,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:02:20,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310999941] [2024-11-09 05:02:20,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:20,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:02:20,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:02:20,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:02:20,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:02:20,361 INFO L87 Difference]: Start difference. First operand 168 states and 308 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:20,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:20,624 INFO L93 Difference]: Finished difference Result 198 states and 354 transitions. [2024-11-09 05:02:20,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:02:20,625 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 05:02:20,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:20,627 INFO L225 Difference]: With dead ends: 198 [2024-11-09 05:02:20,627 INFO L226 Difference]: Without dead ends: 187 [2024-11-09 05:02:20,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-09 05:02:20,629 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 90 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:20,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 17 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:02:20,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-09 05:02:20,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 152. [2024-11-09 05:02:20,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 141 states have (on average 1.9219858156028369) internal successors, (271), 151 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:20,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 271 transitions. [2024-11-09 05:02:20,637 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 271 transitions. Word has length 14 [2024-11-09 05:02:20,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:20,638 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 271 transitions. [2024-11-09 05:02:20,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 271 transitions. [2024-11-09 05:02:20,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:02:20,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:20,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:20,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 05:02:20,640 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:20,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:20,641 INFO L85 PathProgramCache]: Analyzing trace with hash 814579846, now seen corresponding path program 1 times [2024-11-09 05:02:20,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:02:20,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830390559] [2024-11-09 05:02:20,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:20,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:02:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:20,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:20,866 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:02:20,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830390559] [2024-11-09 05:02:20,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830390559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:20,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:20,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:02:20,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091284253] [2024-11-09 05:02:20,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:20,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:02:20,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:02:20,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:02:20,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:02:20,869 INFO L87 Difference]: Start difference. First operand 152 states and 271 transitions. Second operand has 5 states, 4 states have (on average 3.75) 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) [2024-11-09 05:02:20,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:20,970 INFO L93 Difference]: Finished difference Result 152 states and 271 transitions. [2024-11-09 05:02:20,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:02:20,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) 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 [2024-11-09 05:02:20,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:20,972 INFO L225 Difference]: With dead ends: 152 [2024-11-09 05:02:20,972 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 05:02:20,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:02:20,973 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 42 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:20,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 15 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:02:20,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 05:02:20,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-09 05:02:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 132 states have (on average 1.8636363636363635) internal successors, (246), 138 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:20,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 246 transitions. [2024-11-09 05:02:20,979 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 246 transitions. Word has length 15 [2024-11-09 05:02:20,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:20,979 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 246 transitions. [2024-11-09 05:02:20,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) 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) [2024-11-09 05:02:20,979 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 246 transitions. [2024-11-09 05:02:20,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:02:20,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:20,982 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:20,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 05:02:20,982 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:20,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:20,983 INFO L85 PathProgramCache]: Analyzing trace with hash 814579847, now seen corresponding path program 1 times [2024-11-09 05:02:20,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:02:20,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871188092] [2024-11-09 05:02:20,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:20,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:02:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:21,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:21,175 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:02:21,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871188092] [2024-11-09 05:02:21,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871188092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:21,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:21,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:02:21,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952540786] [2024-11-09 05:02:21,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:21,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:02:21,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:02:21,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:02:21,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:21,178 INFO L87 Difference]: Start difference. First operand 139 states and 246 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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) [2024-11-09 05:02:21,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:21,245 INFO L93 Difference]: Finished difference Result 139 states and 246 transitions. [2024-11-09 05:02:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:02:21,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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 [2024-11-09 05:02:21,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:21,246 INFO L225 Difference]: With dead ends: 139 [2024-11-09 05:02:21,247 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 05:02:21,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:21,248 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 14 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 10 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 [2024-11-09 05:02:21,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 10 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:02:21,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 05:02:21,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-09 05:02:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 115 states have (on average 1.791304347826087) internal successors, (206), 117 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:21,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 206 transitions. [2024-11-09 05:02:21,254 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 206 transitions. Word has length 15 [2024-11-09 05:02:21,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:21,254 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 206 transitions. [2024-11-09 05:02:21,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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) [2024-11-09 05:02:21,254 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 206 transitions. [2024-11-09 05:02:21,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:02:21,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:21,256 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:21,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 05:02:21,256 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:21,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:21,257 INFO L85 PathProgramCache]: Analyzing trace with hash -181198757, now seen corresponding path program 1 times [2024-11-09 05:02:21,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:02:21,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093754523] [2024-11-09 05:02:21,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:21,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:02:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 05:02:21,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 05:02:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 05:02:21,373 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 05:02:21,373 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 05:02:21,374 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (35 of 36 remaining) [2024-11-09 05:02:21,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 36 remaining) [2024-11-09 05:02:21,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 36 remaining) [2024-11-09 05:02:21,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 36 remaining) [2024-11-09 05:02:21,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 36 remaining) [2024-11-09 05:02:21,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 36 remaining) [2024-11-09 05:02:21,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 36 remaining) [2024-11-09 05:02:21,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 36 remaining) [2024-11-09 05:02:21,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 36 remaining) [2024-11-09 05:02:21,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 36 remaining) [2024-11-09 05:02:21,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 36 remaining) [2024-11-09 05:02:21,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 36 remaining) [2024-11-09 05:02:21,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 36 remaining) [2024-11-09 05:02:21,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 36 remaining) [2024-11-09 05:02:21,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 36 remaining) [2024-11-09 05:02:21,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 36 remaining) [2024-11-09 05:02:21,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 36 remaining) [2024-11-09 05:02:21,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 36 remaining) [2024-11-09 05:02:21,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 36 remaining) [2024-11-09 05:02:21,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 36 remaining) [2024-11-09 05:02:21,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 36 remaining) [2024-11-09 05:02:21,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 36 remaining) [2024-11-09 05:02:21,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 36 remaining) [2024-11-09 05:02:21,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 36 remaining) [2024-11-09 05:02:21,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 36 remaining) [2024-11-09 05:02:21,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 36 remaining) [2024-11-09 05:02:21,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 36 remaining) [2024-11-09 05:02:21,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 36 remaining) [2024-11-09 05:02:21,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 36 remaining) [2024-11-09 05:02:21,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 36 remaining) [2024-11-09 05:02:21,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 36 remaining) [2024-11-09 05:02:21,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 36 remaining) [2024-11-09 05:02:21,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 36 remaining) [2024-11-09 05:02:21,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 36 remaining) [2024-11-09 05:02:21,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 36 remaining) [2024-11-09 05:02:21,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 36 remaining) [2024-11-09 05:02:21,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 05:02:21,391 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:21,445 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 05:02:21,445 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 05:02:21,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 05:02:21 BasicIcfg [2024-11-09 05:02:21,450 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 05:02:21,451 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 05:02:21,451 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 05:02:21,451 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 05:02:21,452 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:02:14" (3/4) ... [2024-11-09 05:02:21,455 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 05:02:21,456 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 05:02:21,457 INFO L158 Benchmark]: Toolchain (without parser) took 9711.69ms. Allocated memory was 176.2MB in the beginning and 264.2MB in the end (delta: 88.1MB). Free memory was 132.7MB in the beginning and 92.6MB in the end (delta: 40.0MB). Peak memory consumption was 129.4MB. Max. memory is 16.1GB. [2024-11-09 05:02:21,457 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 132.1MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 05:02:21,457 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1116.29ms. Allocated memory is still 176.2MB. Free memory was 132.2MB in the beginning and 134.1MB in the end (delta: -1.9MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. [2024-11-09 05:02:21,458 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.79ms. Allocated memory is still 176.2MB. Free memory was 134.1MB in the beginning and 131.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 05:02:21,458 INFO L158 Benchmark]: Boogie Preprocessor took 54.94ms. Allocated memory is still 176.2MB. Free memory was 131.1MB in the beginning and 129.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 05:02:21,459 INFO L158 Benchmark]: RCFGBuilder took 1048.20ms. Allocated memory is still 176.2MB. Free memory was 129.0MB in the beginning and 73.5MB in the end (delta: 55.4MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-11-09 05:02:21,459 INFO L158 Benchmark]: TraceAbstraction took 7378.52ms. Allocated memory was 176.2MB in the beginning and 264.2MB in the end (delta: 88.1MB). Free memory was 73.3MB in the beginning and 93.7MB in the end (delta: -20.4MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. [2024-11-09 05:02:21,460 INFO L158 Benchmark]: Witness Printer took 5.28ms. Allocated memory is still 264.2MB. Free memory was 93.7MB in the beginning and 92.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 05:02:21,463 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.31ms. Allocated memory is still 132.1MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1116.29ms. Allocated memory is still 176.2MB. Free memory was 132.2MB in the beginning and 134.1MB in the end (delta: -1.9MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.79ms. Allocated memory is still 176.2MB. Free memory was 134.1MB in the beginning and 131.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.94ms. Allocated memory is still 176.2MB. Free memory was 131.1MB in the beginning and 129.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1048.20ms. Allocated memory is still 176.2MB. Free memory was 129.0MB in the beginning and 73.5MB in the end (delta: 55.4MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7378.52ms. Allocated memory was 176.2MB in the beginning and 264.2MB in the end (delta: 88.1MB). Free memory was 73.3MB in the beginning and 93.7MB in the end (delta: -20.4MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. * Witness Printer took 5.28ms. Allocated memory is still 264.2MB. Free memory was 93.7MB in the beginning and 92.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1244]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1244. Possible FailurePath: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1245] 0 pthread_t t1; [L1246] 0 struct s *p = malloc(sizeof(struct s)); [L1247] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [A={0:0}, A_mutex={1:0}, \old(p)={-2:0}, \old(x)=9, p={-2:0}, x=9] [L1229] 0 p -> next = ((void *)0) [L1247] RET 0 init(p,9) [L1248] 0 A = malloc(sizeof(struct s)) [L1249] CALL 0 init(A,3) [L1228] 0 p -> datum = x VAL [A={-3:0}, A_mutex={1:0}, \old(p)={-3:0}, \old(x)=3, p={-3:0}, x=3] [L1229] 0 p -> next = ((void *)0) [L1249] RET 0 init(A,3) [L1250] 0 A->next = p [L1251] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-3:0}, A_mutex={1:0}, p={-2:0}, t1=-1] [L1253] EXPR 0 A->next [L1253] 0 p = A->next [L1254] 0 p->datum [L1256] 0 return 0; VAL [A={-3:0}, A_mutex={1:0}, \result=0, p={-2:0}, t1=-1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 74 locations, 36 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 413 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 413 mSDsluCounter, 231 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 110 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 982 IncrementalHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 121 mSDtfsCounter, 982 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308occurred in iteration=0, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 120 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 899 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 05:02:21,507 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68b918b5051efa1a4363a7cd528e42e31cd4f687fef5116849d37b2131e9c46c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:02:24,280 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:02:24,394 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-09 05:02:24,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:02:24,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:02:24,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:02:24,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:02:24,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:02:24,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:02:24,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:02:24,455 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:02:24,456 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:02:24,456 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:02:24,457 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:02:24,457 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:02:24,458 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:02:24,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 05:02:24,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 05:02:24,460 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:02:24,460 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:02:24,461 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:02:24,465 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:02:24,465 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:02:24,466 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 05:02:24,466 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 05:02:24,466 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 05:02:24,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:02:24,467 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 05:02:24,467 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 05:02:24,468 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:02:24,468 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 05:02:24,468 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 05:02:24,471 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:02:24,471 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:02:24,471 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:02:24,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 05:02:24,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:02:24,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:02:24,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:02:24,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:02:24,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:02:24,475 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 05:02:24,475 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 05:02:24,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:02:24,476 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:02:24,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 68b918b5051efa1a4363a7cd528e42e31cd4f687fef5116849d37b2131e9c46c [2024-11-09 05:02:24,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:02:24,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:02:24,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:02:24,938 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:02:24,939 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:02:24,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i Unable to find full path for "g++" [2024-11-09 05:02:27,371 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:02:27,761 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:02:27,763 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i [2024-11-09 05:02:27,788 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/data/8a55b14a0/89359b6eeb2f4c0cad836532275d009e/FLAGc92aea84b [2024-11-09 05:02:27,945 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/data/8a55b14a0/89359b6eeb2f4c0cad836532275d009e [2024-11-09 05:02:27,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:02:27,948 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:02:27,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:02:27,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:02:27,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:02:27,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:02:27" (1/1) ... [2024-11-09 05:02:27,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@118ddfa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:27, skipping insertion in model container [2024-11-09 05:02:27,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:02:27" (1/1) ... [2024-11-09 05:02:28,035 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:02:29,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:02:29,123 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:02:29,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:02:29,402 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:02:29,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:29 WrapperNode [2024-11-09 05:02:29,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:02:29,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:02:29,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:02:29,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:02:29,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:29" (1/1) ... [2024-11-09 05:02:29,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:29" (1/1) ... [2024-11-09 05:02:29,486 INFO L138 Inliner]: procedures = 369, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2024-11-09 05:02:29,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:02:29,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:02:29,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:02:29,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:02:29,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:29" (1/1) ... [2024-11-09 05:02:29,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:29" (1/1) ... [2024-11-09 05:02:29,507 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:29" (1/1) ... [2024-11-09 05:02:29,507 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:29" (1/1) ... [2024-11-09 05:02:29,521 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:29" (1/1) ... [2024-11-09 05:02:29,523 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:29" (1/1) ... [2024-11-09 05:02:29,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:29" (1/1) ... [2024-11-09 05:02:29,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:29" (1/1) ... [2024-11-09 05:02:29,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:02:29,535 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:02:29,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:02:29,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:02:29,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:29" (1/1) ... [2024-11-09 05:02:29,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:02:29,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:02:29,581 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:02:29,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:02:29,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-09 05:02:29,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 05:02:29,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-09 05:02:29,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-11-09 05:02:29,615 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 05:02:29,616 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 05:02:29,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 05:02:29,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:02:29,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 05:02:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 05:02:29,617 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 05:02:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:02:29,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:02:29,619 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 05:02:29,837 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:02:29,840 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:02:30,325 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 05:02:30,325 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:02:30,734 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:02:30,735 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 05:02:30,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:02:30 BoogieIcfgContainer [2024-11-09 05:02:30,736 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:02:30,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:02:30,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:02:30,744 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:02:30,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:02:27" (1/3) ... [2024-11-09 05:02:30,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7698272e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:02:30, skipping insertion in model container [2024-11-09 05:02:30,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:02:29" (2/3) ... [2024-11-09 05:02:30,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7698272e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:02:30, skipping insertion in model container [2024-11-09 05:02:30,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:02:30" (3/3) ... [2024-11-09 05:02:30,750 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_02-list_nr.i [2024-11-09 05:02:30,775 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:02:30,775 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2024-11-09 05:02:30,776 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 05:02:30,879 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 05:02:30,923 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 51 transitions, 106 flow [2024-11-09 05:02:31,000 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 308 states, 233 states have (on average 2.4206008583690988) internal successors, (564), 307 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:31,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:02:31,059 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@3a9c33cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:02:31,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2024-11-09 05:02:31,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 308 states, 233 states have (on average 2.4206008583690988) internal successors, (564), 307 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:31,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 05:02:31,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:31,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-09 05:02:31,075 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:31,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:31,082 INFO L85 PathProgramCache]: Analyzing trace with hash 11277, now seen corresponding path program 1 times [2024-11-09 05:02:31,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:02:31,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022078359] [2024-11-09 05:02:31,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:31,103 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 [2024-11-09 05:02:31,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:02:31,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:02:31,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:02:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:31,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 05:02:31,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:02:31,490 INFO L378 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 [2024-11-09 05:02:31,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:31,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:02:31,510 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:02:31,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022078359] [2024-11-09 05:02:31,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1022078359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:31,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:31,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 05:02:31,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044626507] [2024-11-09 05:02:31,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:31,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:02:31,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:02:31,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:02:31,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:31,563 INFO L87 Difference]: Start difference. First operand has 308 states, 233 states have (on average 2.4206008583690988) internal successors, (564), 307 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:31,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:31,892 INFO L93 Difference]: Finished difference Result 308 states and 564 transitions. [2024-11-09 05:02:31,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:02:31,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2024-11-09 05:02:31,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:31,916 INFO L225 Difference]: With dead ends: 308 [2024-11-09 05:02:31,916 INFO L226 Difference]: Without dead ends: 304 [2024-11-09 05:02:31,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:31,924 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:31,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 32 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:02:31,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-09 05:02:31,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2024-11-09 05:02:31,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 233 states have (on average 2.40343347639485) internal successors, (560), 303 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:31,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 560 transitions. [2024-11-09 05:02:32,002 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 560 transitions. Word has length 2 [2024-11-09 05:02:32,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:32,003 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 560 transitions. [2024-11-09 05:02:32,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:32,004 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 560 transitions. [2024-11-09 05:02:32,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 05:02:32,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:32,005 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-09 05:02:32,012 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:02:32,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:02:32,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:32,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:32,207 INFO L85 PathProgramCache]: Analyzing trace with hash 11278, now seen corresponding path program 1 times [2024-11-09 05:02:32,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:02:32,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75425990] [2024-11-09 05:02:32,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:32,208 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 [2024-11-09 05:02:32,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:02:32,213 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:02:32,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:02:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:32,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 05:02:32,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:02:32,390 INFO L378 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 [2024-11-09 05:02:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:32,403 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:02:32,404 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:02:32,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75425990] [2024-11-09 05:02:32,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75425990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:32,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:32,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 05:02:32,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950105956] [2024-11-09 05:02:32,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:32,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:02:32,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:02:32,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:02:32,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:32,408 INFO L87 Difference]: Start difference. First operand 304 states and 560 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:32,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:32,660 INFO L93 Difference]: Finished difference Result 304 states and 560 transitions. [2024-11-09 05:02:32,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:02:32,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2024-11-09 05:02:32,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:32,665 INFO L225 Difference]: With dead ends: 304 [2024-11-09 05:02:32,668 INFO L226 Difference]: Without dead ends: 300 [2024-11-09 05:02:32,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:32,670 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:32,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 33 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:02:32,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-09 05:02:32,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2024-11-09 05:02:32,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 233 states have (on average 2.3862660944206007) internal successors, (556), 299 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:32,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 556 transitions. [2024-11-09 05:02:32,720 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 556 transitions. Word has length 2 [2024-11-09 05:02:32,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:32,721 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 556 transitions. [2024-11-09 05:02:32,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:32,722 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 556 transitions. [2024-11-09 05:02:32,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 05:02:32,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:32,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 05:02:32,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:02:32,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:02:32,924 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:32,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:32,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1834066327, now seen corresponding path program 1 times [2024-11-09 05:02:32,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:02:32,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689985918] [2024-11-09 05:02:32,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:32,926 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 [2024-11-09 05:02:32,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:02:32,934 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:02:32,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:02:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:33,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:02:33,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:02:33,163 INFO L378 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 [2024-11-09 05:02:33,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:33,183 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:02:33,183 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:02:33,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689985918] [2024-11-09 05:02:33,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689985918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:33,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:33,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:02:33,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416756866] [2024-11-09 05:02:33,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:33,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:02:33,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:02:33,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:02:33,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:33,188 INFO L87 Difference]: Start difference. First operand 300 states and 556 transitions. Second operand has 3 states, 2 states have (on average 3.0) 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) [2024-11-09 05:02:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:33,373 INFO L93 Difference]: Finished difference Result 300 states and 556 transitions. [2024-11-09 05:02:33,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:02:33,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) 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 [2024-11-09 05:02:33,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:33,377 INFO L225 Difference]: With dead ends: 300 [2024-11-09 05:02:33,377 INFO L226 Difference]: Without dead ends: 252 [2024-11-09 05:02:33,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:33,380 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:33,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 7 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:02:33,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-09 05:02:33,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2024-11-09 05:02:33,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 207 states have (on average 2.241545893719807) internal successors, (464), 251 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:33,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 464 transitions. [2024-11-09 05:02:33,407 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 464 transitions. Word has length 6 [2024-11-09 05:02:33,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:33,411 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 464 transitions. [2024-11-09 05:02:33,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) 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) [2024-11-09 05:02:33,411 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 464 transitions. [2024-11-09 05:02:33,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 05:02:33,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:33,412 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 05:02:33,416 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 05:02:33,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:02:33,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:33,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:33,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1834066328, now seen corresponding path program 1 times [2024-11-09 05:02:33,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:02:33,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711845648] [2024-11-09 05:02:33,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:33,617 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 [2024-11-09 05:02:33,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:02:33,621 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:02:33,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:02:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:33,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:02:33,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:02:33,833 INFO L378 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 [2024-11-09 05:02:33,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:33,871 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:02:33,872 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:02:33,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711845648] [2024-11-09 05:02:33,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711845648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:33,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:33,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:02:33,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376572890] [2024-11-09 05:02:33,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:33,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:02:33,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:02:33,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:02:33,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:33,875 INFO L87 Difference]: Start difference. First operand 252 states and 464 transitions. Second operand has 3 states, 2 states have (on average 3.0) 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) [2024-11-09 05:02:34,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:34,053 INFO L93 Difference]: Finished difference Result 252 states and 464 transitions. [2024-11-09 05:02:34,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:02:34,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) 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 [2024-11-09 05:02:34,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:34,056 INFO L225 Difference]: With dead ends: 252 [2024-11-09 05:02:34,057 INFO L226 Difference]: Without dead ends: 208 [2024-11-09 05:02:34,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:34,059 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:34,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 8 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:02:34,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-09 05:02:34,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-11-09 05:02:34,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 2.0994475138121547) internal successors, (380), 207 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:34,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 380 transitions. [2024-11-09 05:02:34,070 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 380 transitions. Word has length 6 [2024-11-09 05:02:34,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:34,070 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 380 transitions. [2024-11-09 05:02:34,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) 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) [2024-11-09 05:02:34,071 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 380 transitions. [2024-11-09 05:02:34,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 05:02:34,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:34,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:34,079 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:02:34,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:02:34,276 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:34,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:34,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1903559775, now seen corresponding path program 1 times [2024-11-09 05:02:34,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:02:34,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966087143] [2024-11-09 05:02:34,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:34,278 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 [2024-11-09 05:02:34,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:02:34,282 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:02:34,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:02:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:34,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 05:02:34,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:02:34,520 INFO L378 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 [2024-11-09 05:02:34,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:34,537 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:02:34,537 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:02:34,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966087143] [2024-11-09 05:02:34,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966087143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:34,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:34,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:02:34,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229399964] [2024-11-09 05:02:34,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:34,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:02:34,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:02:34,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:02:34,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:34,545 INFO L87 Difference]: Start difference. First operand 208 states and 380 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:34,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:34,724 INFO L93 Difference]: Finished difference Result 208 states and 380 transitions. [2024-11-09 05:02:34,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:02:34,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 05:02:34,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:34,728 INFO L225 Difference]: With dead ends: 208 [2024-11-09 05:02:34,728 INFO L226 Difference]: Without dead ends: 184 [2024-11-09 05:02:34,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:34,729 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:34,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 17 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:02:34,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-09 05:02:34,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-11-09 05:02:34,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 165 states have (on average 2.0242424242424244) internal successors, (334), 183 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:34,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 334 transitions. [2024-11-09 05:02:34,737 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 334 transitions. Word has length 9 [2024-11-09 05:02:34,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:34,737 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 334 transitions. [2024-11-09 05:02:34,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:34,738 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 334 transitions. [2024-11-09 05:02:34,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 05:02:34,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:34,738 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:34,747 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 05:02:34,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:02:34,939 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:34,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:34,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1903559774, now seen corresponding path program 1 times [2024-11-09 05:02:34,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:02:34,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229739779] [2024-11-09 05:02:34,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:34,940 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 [2024-11-09 05:02:34,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:02:34,943 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:02:34,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:02:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:35,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 05:02:35,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:02:35,154 INFO L378 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 [2024-11-09 05:02:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:35,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:02:35,166 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:02:35,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229739779] [2024-11-09 05:02:35,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229739779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:35,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:35,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:02:35,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095770253] [2024-11-09 05:02:35,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:35,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:02:35,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:02:35,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:02:35,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:35,168 INFO L87 Difference]: Start difference. First operand 184 states and 334 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:35,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:35,364 INFO L93 Difference]: Finished difference Result 184 states and 334 transitions. [2024-11-09 05:02:35,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:02:35,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 05:02:35,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:35,366 INFO L225 Difference]: With dead ends: 184 [2024-11-09 05:02:35,366 INFO L226 Difference]: Without dead ends: 160 [2024-11-09 05:02:35,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:35,368 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:35,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 19 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:02:35,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-09 05:02:35,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-11-09 05:02:35,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 149 states have (on average 1.9328859060402686) internal successors, (288), 159 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 288 transitions. [2024-11-09 05:02:35,374 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 288 transitions. Word has length 9 [2024-11-09 05:02:35,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:35,374 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 288 transitions. [2024-11-09 05:02:35,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:35,374 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 288 transitions. [2024-11-09 05:02:35,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 05:02:35,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:35,375 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:35,379 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 05:02:35,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:02:35,579 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:35,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:35,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1759856248, now seen corresponding path program 1 times [2024-11-09 05:02:35,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:02:35,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705924134] [2024-11-09 05:02:35,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:35,581 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 [2024-11-09 05:02:35,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:02:35,585 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:02:35,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:02:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:35,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 05:02:35,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:02:35,845 INFO L378 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 [2024-11-09 05:02:35,916 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-09 05:02:35,916 INFO L378 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 21 treesize of output 20 [2024-11-09 05:02:35,978 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 05:02:36,063 INFO L378 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 33 treesize of output 15 [2024-11-09 05:02:36,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:36,069 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:02:36,069 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:02:36,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1705924134] [2024-11-09 05:02:36,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1705924134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:36,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:36,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:02:36,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44082734] [2024-11-09 05:02:36,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:36,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:02:36,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:02:36,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:02:36,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:02:36,071 INFO L87 Difference]: Start difference. First operand 160 states and 288 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:36,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:36,553 INFO L93 Difference]: Finished difference Result 237 states and 432 transitions. [2024-11-09 05:02:36,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:02:36,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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 [2024-11-09 05:02:36,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:36,556 INFO L225 Difference]: With dead ends: 237 [2024-11-09 05:02:36,556 INFO L226 Difference]: Without dead ends: 224 [2024-11-09 05:02:36,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:02:36,557 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 50 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:36,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 14 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:02:36,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-09 05:02:36,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 169. [2024-11-09 05:02:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 158 states have (on average 2.0) internal successors, (316), 168 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:36,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 316 transitions. [2024-11-09 05:02:36,565 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 316 transitions. Word has length 12 [2024-11-09 05:02:36,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:36,565 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 316 transitions. [2024-11-09 05:02:36,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:36,565 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 316 transitions. [2024-11-09 05:02:36,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 05:02:36,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:36,566 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:36,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:02:36,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:02:36,770 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:36,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:36,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1759856249, now seen corresponding path program 1 times [2024-11-09 05:02:36,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:02:36,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735277507] [2024-11-09 05:02:36,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:36,772 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 [2024-11-09 05:02:36,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:02:36,778 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:02:36,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 (9)] Waiting until timeout for monitored process [2024-11-09 05:02:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:37,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 05:02:37,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:02:37,014 INFO L378 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 [2024-11-09 05:02:37,023 INFO L378 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 [2024-11-09 05:02:37,115 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 05:02:37,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 13 [2024-11-09 05:02:37,143 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:02:37,144 INFO L378 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 [2024-11-09 05:02:37,221 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 05:02:37,244 INFO L378 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 13 treesize of output 9 [2024-11-09 05:02:37,373 INFO L378 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 31 treesize of output 13 [2024-11-09 05:02:37,387 INFO L378 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 9 treesize of output 3 [2024-11-09 05:02:37,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:37,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:02:37,419 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:02:37,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735277507] [2024-11-09 05:02:37,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735277507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:37,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:37,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:02:37,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108701405] [2024-11-09 05:02:37,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:37,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:02:37,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:02:37,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:02:37,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:02:37,421 INFO L87 Difference]: Start difference. First operand 169 states and 316 transitions. Second operand has 6 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) [2024-11-09 05:02:37,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:37,883 INFO L93 Difference]: Finished difference Result 224 states and 407 transitions. [2024-11-09 05:02:37,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:02:37,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 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 [2024-11-09 05:02:37,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:37,885 INFO L225 Difference]: With dead ends: 224 [2024-11-09 05:02:37,885 INFO L226 Difference]: Without dead ends: 211 [2024-11-09 05:02:37,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:02:37,886 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 110 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:37,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 12 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:02:37,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-09 05:02:37,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 167. [2024-11-09 05:02:37,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 156 states have (on average 1.9294871794871795) internal successors, (301), 166 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:37,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 301 transitions. [2024-11-09 05:02:37,893 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 301 transitions. Word has length 12 [2024-11-09 05:02:37,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:37,894 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 301 transitions. [2024-11-09 05:02:37,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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) [2024-11-09 05:02:37,894 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 301 transitions. [2024-11-09 05:02:37,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 05:02:37,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:37,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:37,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 (9)] Ended with exit code 0 [2024-11-09 05:02:38,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:02:38,096 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:38,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:38,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1839523209, now seen corresponding path program 1 times [2024-11-09 05:02:38,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:02:38,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965479901] [2024-11-09 05:02:38,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:38,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 [2024-11-09 05:02:38,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:02:38,100 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:02:38,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 (10)] Waiting until timeout for monitored process [2024-11-09 05:02:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:38,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 05:02:38,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:02:38,390 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 05:02:38,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 22 [2024-11-09 05:02:38,485 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-09 05:02:38,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-11-09 05:02:38,661 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 05:02:38,857 INFO L349 Elim1Store]: treesize reduction 110, result has 29.5 percent of original size [2024-11-09 05:02:38,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 82 [2024-11-09 05:02:39,049 INFO L378 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 63 treesize of output 52 [2024-11-09 05:02:39,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:02:39,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 133 treesize of output 99 [2024-11-09 05:02:40,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:40,386 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:02:40,386 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:02:40,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1965479901] [2024-11-09 05:02:40,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1965479901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:40,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:40,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:02:40,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713877417] [2024-11-09 05:02:40,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:40,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:02:40,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:02:40,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:02:40,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:02:40,389 INFO L87 Difference]: Start difference. First operand 167 states and 301 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:43,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:02:45,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:02:46,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:46,258 INFO L93 Difference]: Finished difference Result 209 states and 375 transitions. [2024-11-09 05:02:46,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 05:02:46,259 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 05:02:46,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:46,260 INFO L225 Difference]: With dead ends: 209 [2024-11-09 05:02:46,261 INFO L226 Difference]: Without dead ends: 198 [2024-11-09 05:02:46,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-11-09 05:02:46,262 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 137 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:46,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 21 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 184 Invalid, 3 Unknown, 0 Unchecked, 5.0s Time] [2024-11-09 05:02:46,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-09 05:02:46,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 168. [2024-11-09 05:02:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 157 states have (on average 1.9617834394904459) internal successors, (308), 167 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:46,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 308 transitions. [2024-11-09 05:02:46,268 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 308 transitions. Word has length 14 [2024-11-09 05:02:46,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:46,268 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 308 transitions. [2024-11-09 05:02:46,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:46,269 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 308 transitions. [2024-11-09 05:02:46,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 05:02:46,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:46,270 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:46,274 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 (10)] Ended with exit code 0 [2024-11-09 05:02:46,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:02:46,470 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:46,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:46,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1839523208, now seen corresponding path program 1 times [2024-11-09 05:02:46,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:02:46,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141772659] [2024-11-09 05:02:46,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:46,471 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 [2024-11-09 05:02:46,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:02:46,475 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:02:46,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 (11)] Waiting until timeout for monitored process [2024-11-09 05:02:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:46,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 05:02:46,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:02:46,764 INFO L378 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 [2024-11-09 05:02:46,773 INFO L378 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 [2024-11-09 05:02:46,835 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 05:02:46,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 13 [2024-11-09 05:02:46,878 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 05:02:46,878 INFO L378 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 [2024-11-09 05:02:46,973 INFO L378 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 13 treesize of output 9 [2024-11-09 05:02:46,989 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 05:02:47,115 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-11-09 05:02:47,116 INFO L378 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 1 case distinctions, treesize of input 18 treesize of output 20 [2024-11-09 05:02:47,165 INFO L349 Elim1Store]: treesize reduction 12, result has 55.6 percent of original size [2024-11-09 05:02:47,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2024-11-09 05:02:47,239 INFO L378 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 40 treesize of output 31 [2024-11-09 05:02:47,259 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 05:02:47,452 INFO L378 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 41 treesize of output 17 [2024-11-09 05:02:47,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 9 treesize of output 3 [2024-11-09 05:02:47,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:47,514 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:02:47,514 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:02:47,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141772659] [2024-11-09 05:02:47,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141772659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:47,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:47,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:02:47,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031147099] [2024-11-09 05:02:47,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:47,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:02:47,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:02:47,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:02:47,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:02:47,517 INFO L87 Difference]: Start difference. First operand 168 states and 308 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:48,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:48,843 INFO L93 Difference]: Finished difference Result 198 states and 354 transitions. [2024-11-09 05:02:48,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 05:02:48,844 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 05:02:48,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:48,845 INFO L225 Difference]: With dead ends: 198 [2024-11-09 05:02:48,845 INFO L226 Difference]: Without dead ends: 187 [2024-11-09 05:02:48,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-11-09 05:02:48,847 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 119 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:48,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 16 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 05:02:48,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-09 05:02:48,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 152. [2024-11-09 05:02:48,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 141 states have (on average 1.9219858156028369) internal successors, (271), 151 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 271 transitions. [2024-11-09 05:02:48,855 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 271 transitions. Word has length 14 [2024-11-09 05:02:48,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:48,856 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 271 transitions. [2024-11-09 05:02:48,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 271 transitions. [2024-11-09 05:02:48,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:02:48,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:48,857 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:48,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 (11)] Forceful destruction successful, exit code 0 [2024-11-09 05:02:49,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:02:49,059 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:49,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:49,059 INFO L85 PathProgramCache]: Analyzing trace with hash 207881928, now seen corresponding path program 1 times [2024-11-09 05:02:49,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:02:49,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341929340] [2024-11-09 05:02:49,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:49,060 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 [2024-11-09 05:02:49,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:02:49,065 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:02:49,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 (12)] Waiting until timeout for monitored process [2024-11-09 05:02:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:49,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:02:49,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:02:49,317 INFO L378 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 [2024-11-09 05:02:49,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:49,340 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:02:49,340 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:02:49,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341929340] [2024-11-09 05:02:49,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341929340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:49,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:49,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:02:49,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767151640] [2024-11-09 05:02:49,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:49,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:02:49,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:02:49,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:02:49,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:49,341 INFO L87 Difference]: Start difference. First operand 152 states and 271 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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) [2024-11-09 05:02:49,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:49,497 INFO L93 Difference]: Finished difference Result 152 states and 271 transitions. [2024-11-09 05:02:49,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:02:49,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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 [2024-11-09 05:02:49,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:49,499 INFO L225 Difference]: With dead ends: 152 [2024-11-09 05:02:49,499 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 05:02:49,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:49,500 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 15 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:49,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 8 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:02:49,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 05:02:49,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-09 05:02:49,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 132 states have (on average 1.8636363636363635) internal successors, (246), 138 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:49,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 246 transitions. [2024-11-09 05:02:49,505 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 246 transitions. Word has length 15 [2024-11-09 05:02:49,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:49,505 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 246 transitions. [2024-11-09 05:02:49,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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) [2024-11-09 05:02:49,506 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 246 transitions. [2024-11-09 05:02:49,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:02:49,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:49,507 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:49,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 (12)] Forceful destruction successful, exit code 0 [2024-11-09 05:02:49,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:02:49,711 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:49,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:49,711 INFO L85 PathProgramCache]: Analyzing trace with hash 207881929, now seen corresponding path program 1 times [2024-11-09 05:02:49,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:02:49,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [336358791] [2024-11-09 05:02:49,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:49,712 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 [2024-11-09 05:02:49,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:02:49,715 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:02:49,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 (13)] Waiting until timeout for monitored process [2024-11-09 05:02:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:49,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:02:49,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:02:49,927 INFO L378 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 [2024-11-09 05:02:49,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:49,964 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:02:49,964 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:02:49,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [336358791] [2024-11-09 05:02:49,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [336358791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:49,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:49,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:02:49,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503552813] [2024-11-09 05:02:49,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:49,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:02:49,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:02:49,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:02:49,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:49,966 INFO L87 Difference]: Start difference. First operand 139 states and 246 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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) [2024-11-09 05:02:50,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:50,103 INFO L93 Difference]: Finished difference Result 139 states and 246 transitions. [2024-11-09 05:02:50,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:02:50,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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 [2024-11-09 05:02:50,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:50,105 INFO L225 Difference]: With dead ends: 139 [2024-11-09 05:02:50,105 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 05:02:50,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:50,106 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 14 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 10 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 [2024-11-09 05:02:50,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 10 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:02:50,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 05:02:50,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-09 05:02:50,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 115 states have (on average 1.791304347826087) internal successors, (206), 117 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:50,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 206 transitions. [2024-11-09 05:02:50,111 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 206 transitions. Word has length 15 [2024-11-09 05:02:50,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:50,111 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 206 transitions. [2024-11-09 05:02:50,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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) [2024-11-09 05:02:50,111 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 206 transitions. [2024-11-09 05:02:50,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:02:50,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:50,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:50,117 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 (13)] Ended with exit code 0 [2024-11-09 05:02:50,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:02:50,313 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 05:02:50,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:50,313 INFO L85 PathProgramCache]: Analyzing trace with hash -787896675, now seen corresponding path program 1 times [2024-11-09 05:02:50,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:02:50,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061388750] [2024-11-09 05:02:50,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:50,314 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 [2024-11-09 05:02:50,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:02:50,315 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:02:50,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 (14)] Waiting until timeout for monitored process [2024-11-09 05:02:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 05:02:50,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 05:02:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 05:02:50,682 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2024-11-09 05:02:50,682 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 05:02:50,683 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (35 of 36 remaining) [2024-11-09 05:02:50,684 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 36 remaining) [2024-11-09 05:02:50,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 36 remaining) [2024-11-09 05:02:50,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 36 remaining) [2024-11-09 05:02:50,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 36 remaining) [2024-11-09 05:02:50,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 36 remaining) [2024-11-09 05:02:50,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 36 remaining) [2024-11-09 05:02:50,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 36 remaining) [2024-11-09 05:02:50,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 36 remaining) [2024-11-09 05:02:50,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 36 remaining) [2024-11-09 05:02:50,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 36 remaining) [2024-11-09 05:02:50,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 36 remaining) [2024-11-09 05:02:50,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 36 remaining) [2024-11-09 05:02:50,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 36 remaining) [2024-11-09 05:02:50,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 36 remaining) [2024-11-09 05:02:50,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 36 remaining) [2024-11-09 05:02:50,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 36 remaining) [2024-11-09 05:02:50,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 36 remaining) [2024-11-09 05:02:50,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 36 remaining) [2024-11-09 05:02:50,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 36 remaining) [2024-11-09 05:02:50,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 36 remaining) [2024-11-09 05:02:50,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 36 remaining) [2024-11-09 05:02:50,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 36 remaining) [2024-11-09 05:02:50,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 36 remaining) [2024-11-09 05:02:50,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 36 remaining) [2024-11-09 05:02:50,688 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 36 remaining) [2024-11-09 05:02:50,688 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 36 remaining) [2024-11-09 05:02:50,688 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 36 remaining) [2024-11-09 05:02:50,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 36 remaining) [2024-11-09 05:02:50,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 36 remaining) [2024-11-09 05:02:50,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 36 remaining) [2024-11-09 05:02:50,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 36 remaining) [2024-11-09 05:02:50,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 36 remaining) [2024-11-09 05:02:50,690 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 36 remaining) [2024-11-09 05:02:50,690 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 36 remaining) [2024-11-09 05:02:50,690 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 36 remaining) [2024-11-09 05:02:50,696 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 (14)] Ended with exit code 0 [2024-11-09 05:02:50,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:02:50,893 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:50,924 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 05:02:50,925 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 05:02:50,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 05:02:50 BasicIcfg [2024-11-09 05:02:50,928 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 05:02:50,928 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 05:02:50,929 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 05:02:50,929 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 05:02:50,932 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:02:30" (3/4) ... [2024-11-09 05:02:50,934 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 05:02:50,935 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 05:02:50,936 INFO L158 Benchmark]: Toolchain (without parser) took 22987.86ms. Allocated memory was 109.1MB in the beginning and 201.3MB in the end (delta: 92.3MB). Free memory was 82.4MB in the beginning and 157.1MB in the end (delta: -74.7MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2024-11-09 05:02:50,936 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 71.3MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 05:02:50,937 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1454.30ms. Allocated memory is still 109.1MB. Free memory was 82.1MB in the beginning and 65.2MB in the end (delta: 17.0MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2024-11-09 05:02:50,937 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.40ms. Allocated memory is still 109.1MB. Free memory was 65.2MB in the beginning and 62.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 05:02:50,938 INFO L158 Benchmark]: Boogie Preprocessor took 46.03ms. Allocated memory is still 109.1MB. Free memory was 62.0MB in the beginning and 59.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 05:02:50,938 INFO L158 Benchmark]: RCFGBuilder took 1201.97ms. Allocated memory is still 109.1MB. Free memory was 59.9MB in the beginning and 65.0MB in the end (delta: -5.1MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2024-11-09 05:02:50,942 INFO L158 Benchmark]: TraceAbstraction took 20188.88ms. Allocated memory was 109.1MB in the beginning and 201.3MB in the end (delta: 92.3MB). Free memory was 64.3MB in the beginning and 157.1MB in the end (delta: -92.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 05:02:50,942 INFO L158 Benchmark]: Witness Printer took 6.90ms. Allocated memory is still 201.3MB. Free memory is still 157.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 05:02:50,943 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.21ms. Allocated memory is still 71.3MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1454.30ms. Allocated memory is still 109.1MB. Free memory was 82.1MB in the beginning and 65.2MB in the end (delta: 17.0MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.40ms. Allocated memory is still 109.1MB. Free memory was 65.2MB in the beginning and 62.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.03ms. Allocated memory is still 109.1MB. Free memory was 62.0MB in the beginning and 59.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1201.97ms. Allocated memory is still 109.1MB. Free memory was 59.9MB in the beginning and 65.0MB in the end (delta: -5.1MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * TraceAbstraction took 20188.88ms. Allocated memory was 109.1MB in the beginning and 201.3MB in the end (delta: 92.3MB). Free memory was 64.3MB in the beginning and 157.1MB in the end (delta: -92.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.90ms. Allocated memory is still 201.3MB. Free memory is still 157.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1244]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1244. Possible FailurePath: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1245] 0 pthread_t t1; [L1246] 0 struct s *p = malloc(sizeof(struct s)); [L1247] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [A={0:0}, A_mutex={1:0}, \old(p)={2:0}, \old(x)=9, p={2:0}, x=9] [L1229] 0 p -> next = ((void *)0) [L1247] RET 0 init(p,9) [L1248] 0 A = malloc(sizeof(struct s)) [L1249] CALL 0 init(A,3) [L1228] 0 p -> datum = x VAL [A={-2147483647:0}, A_mutex={1:0}, \old(p)={-2147483647:0}, \old(x)=3, p={-2147483647:0}, x=3] [L1229] 0 p -> next = ((void *)0) [L1249] RET 0 init(A,3) [L1250] 0 A->next = p [L1251] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-2147483647:0}, A_mutex={1:0}, p={2:0}, t1=0] [L1253] EXPR 0 A->next [L1253] 0 p = A->next [L1254] 0 p->datum [L1256] 0 return 0; VAL [A={-2147483647:0}, A_mutex={1:0}, \result=0, p={2:0}, t1=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 74 locations, 36 error locations. Started 1 CEGAR loops. OverallTime: 20.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 539 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 539 mSDsluCounter, 197 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 867 IncrementalHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 119 mSDtfsCounter, 867 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308occurred in iteration=0, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 164 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 104 ConstructedInterpolants, 10 QuantifiedInterpolants, 2108 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1840 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 05:02:50,965 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c193d873-0561-487d-9dfc-27919eb43baf/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample