./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8a34048511216dfe9a14f70dd929fd2de5a6eaf4560cb9e9e466dd0467a1d6d7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:11:30,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:11:30,370 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 05:11:30,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:11:30,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:11:30,402 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:11:30,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:11:30,403 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:11:30,403 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:11:30,403 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:11:30,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:11:30,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:11:30,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:11:30,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:11:30,404 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:11:30,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:11:30,405 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:11:30,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:11:30,405 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:11:30,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:11:30,405 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 05:11:30,405 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 05:11:30,405 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 05:11:30,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:11:30,406 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 05:11:30,406 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 05:11:30,406 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:11:30,406 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:11:30,406 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:11:30,406 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:11:30,406 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:11:30,406 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:11:30,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:11:30,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:11:30,407 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:11:30,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:11:30,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:11:30,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:11:30,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:11:30,407 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:11:30,408 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:11:30,408 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 05:11:30,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 05:11:30,408 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:11:30,408 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:11:30,408 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:11:30,408 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:11:30,408 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8a34048511216dfe9a14f70dd929fd2de5a6eaf4560cb9e9e466dd0467a1d6d7 [2024-11-28 05:11:30,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:11:30,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:11:30,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:11:30,784 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:11:30,784 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:11:30,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-1.i [2024-11-28 05:11:33,844 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/data/fe81f9cab/570bf185a0c04cfaba0f8fe0f7b6f91c/FLAG0ea1e7303 [2024-11-28 05:11:34,239 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:11:34,240 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-1.i [2024-11-28 05:11:34,257 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/data/fe81f9cab/570bf185a0c04cfaba0f8fe0f7b6f91c/FLAG0ea1e7303 [2024-11-28 05:11:34,276 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/data/fe81f9cab/570bf185a0c04cfaba0f8fe0f7b6f91c [2024-11-28 05:11:34,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:11:34,279 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:11:34,281 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:11:34,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:11:34,286 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:11:34,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:11:34" (1/1) ... [2024-11-28 05:11:34,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67d2779c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:34, skipping insertion in model container [2024-11-28 05:11:34,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:11:34" (1/1) ... [2024-11-28 05:11:34,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:11:34,744 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:11:34,788 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:11:34,792 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:11:34,797 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:11:34,804 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:11:34,818 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:11:34,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:11:34,832 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:11:34,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:11:34,987 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:11:34,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:34 WrapperNode [2024-11-28 05:11:34,988 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:11:34,989 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:11:34,989 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:11:34,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:11:34,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:34" (1/1) ... [2024-11-28 05:11:35,018 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:34" (1/1) ... [2024-11-28 05:11:35,062 INFO L138 Inliner]: procedures = 176, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 831 [2024-11-28 05:11:35,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:11:35,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:11:35,063 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:11:35,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:11:35,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:34" (1/1) ... [2024-11-28 05:11:35,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:34" (1/1) ... [2024-11-28 05:11:35,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:34" (1/1) ... [2024-11-28 05:11:35,146 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-11-28 05:11:35,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:34" (1/1) ... [2024-11-28 05:11:35,150 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:34" (1/1) ... [2024-11-28 05:11:35,200 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:34" (1/1) ... [2024-11-28 05:11:35,202 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:34" (1/1) ... [2024-11-28 05:11:35,220 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:34" (1/1) ... [2024-11-28 05:11:35,227 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:34" (1/1) ... [2024-11-28 05:11:35,233 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:34" (1/1) ... [2024-11-28 05:11:35,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:11:35,248 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:11:35,249 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:11:35,249 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:11:35,250 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:34" (1/1) ... [2024-11-28 05:11:35,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:11:35,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:11:35,284 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:11:35,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:11:35,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 05:11:35,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 05:11:35,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 05:11:35,329 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 05:11:35,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 05:11:35,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 05:11:35,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-28 05:11:35,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-28 05:11:35,330 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-28 05:11:35,330 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-28 05:11:35,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 05:11:35,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:11:35,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 05:11:35,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 05:11:35,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 05:11:35,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 05:11:35,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 05:11:35,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 05:11:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 05:11:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:11:35,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:11:35,528 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:11:35,529 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:11:35,532 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 05:11:35,583 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 05:11:37,650 INFO L? ?]: Removed 775 outVars from TransFormulas that were not future-live. [2024-11-28 05:11:37,650 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:11:37,695 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:11:37,695 INFO L312 CfgBuilder]: Removed 18 assume(true) statements. [2024-11-28 05:11:37,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:11:37 BoogieIcfgContainer [2024-11-28 05:11:37,696 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:11:37,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:11:37,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:11:37,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:11:37,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:11:34" (1/3) ... [2024-11-28 05:11:37,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7dea48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:11:37, skipping insertion in model container [2024-11-28 05:11:37,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:34" (2/3) ... [2024-11-28 05:11:37,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7dea48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:11:37, skipping insertion in model container [2024-11-28 05:11:37,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:11:37" (3/3) ... [2024-11-28 05:11:37,712 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test1-1.i [2024-11-28 05:11:37,731 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:11:37,733 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test1-1.i that has 4 procedures, 764 locations, 1 initial locations, 20 loop locations, and 320 error locations. [2024-11-28 05:11:37,821 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:11:37,838 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@3cd3bb95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:11:37,838 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-28 05:11:37,847 INFO L276 IsEmpty]: Start isEmpty. Operand has 759 states, 426 states have (on average 2.0586854460093895) internal successors, (877), 753 states have internal predecessors, (877), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:11:37,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 05:11:37,855 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:11:37,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 05:11:37,856 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:11:37,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:37,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1460981578, now seen corresponding path program 1 times [2024-11-28 05:11:37,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:37,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748686230] [2024-11-28 05:11:37,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:37,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:38,027 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-28 05:11:38,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:38,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748686230] [2024-11-28 05:11:38,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748686230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:38,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:38,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:11:38,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761855711] [2024-11-28 05:11:38,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:38,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 05:11:38,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:38,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 05:11:38,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 05:11:38,066 INFO L87 Difference]: Start difference. First operand has 759 states, 426 states have (on average 2.0586854460093895) internal successors, (877), 753 states have internal predecessors, (877), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:38,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:11:38,128 INFO L93 Difference]: Finished difference Result 749 states and 856 transitions. [2024-11-28 05:11:38,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 05:11:38,131 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 05:11:38,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:11:38,157 INFO L225 Difference]: With dead ends: 749 [2024-11-28 05:11:38,157 INFO L226 Difference]: Without dead ends: 747 [2024-11-28 05:11:38,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 05:11:38,164 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:11:38,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:11:38,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2024-11-28 05:11:38,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2024-11-28 05:11:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 420 states have (on average 1.9714285714285715) internal successors, (828), 741 states have internal predecessors, (828), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:11:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 854 transitions. [2024-11-28 05:11:38,264 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 854 transitions. Word has length 6 [2024-11-28 05:11:38,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:11:38,264 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 854 transitions. [2024-11-28 05:11:38,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 854 transitions. [2024-11-28 05:11:38,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 05:11:38,265 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:11:38,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 05:11:38,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 05:11:38,268 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:11:38,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:38,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103338, now seen corresponding path program 1 times [2024-11-28 05:11:38,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:38,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620800403] [2024-11-28 05:11:38,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:38,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:38,427 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-28 05:11:38,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:38,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620800403] [2024-11-28 05:11:38,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620800403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:38,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:38,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:11:38,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116692931] [2024-11-28 05:11:38,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:38,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:11:38,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:38,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:11:38,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:11:38,430 INFO L87 Difference]: Start difference. First operand 747 states and 854 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-28 05:11:39,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:11:39,288 INFO L93 Difference]: Finished difference Result 701 states and 809 transitions. [2024-11-28 05:11:39,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:11:39,289 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-28 05:11:39,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:11:39,293 INFO L225 Difference]: With dead ends: 701 [2024-11-28 05:11:39,293 INFO L226 Difference]: Without dead ends: 701 [2024-11-28 05:11:39,293 INFO L434 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-28 05:11:39,294 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 698 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:11:39,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 510 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 05:11:39,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-11-28 05:11:39,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 698. [2024-11-28 05:11:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 420 states have (on average 1.8547619047619048) internal successors, (779), 692 states have internal predecessors, (779), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:11:39,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 805 transitions. [2024-11-28 05:11:39,323 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 805 transitions. Word has length 6 [2024-11-28 05:11:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:11:39,324 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 805 transitions. [2024-11-28 05:11:39,324 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-28 05:11:39,324 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 805 transitions. [2024-11-28 05:11:39,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 05:11:39,324 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:11:39,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 05:11:39,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 05:11:39,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:11:39,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:39,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103339, now seen corresponding path program 1 times [2024-11-28 05:11:39,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:39,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075016641] [2024-11-28 05:11:39,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:39,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:39,449 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-28 05:11:39,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:39,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075016641] [2024-11-28 05:11:39,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075016641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:39,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:39,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:11:39,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898601520] [2024-11-28 05:11:39,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:39,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:11:39,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:39,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:11:39,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:11:39,451 INFO L87 Difference]: Start difference. First operand 698 states and 805 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-28 05:11:40,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:11:40,132 INFO L93 Difference]: Finished difference Result 777 states and 890 transitions. [2024-11-28 05:11:40,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:11:40,133 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-28 05:11:40,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:11:40,138 INFO L225 Difference]: With dead ends: 777 [2024-11-28 05:11:40,138 INFO L226 Difference]: Without dead ends: 777 [2024-11-28 05:11:40,138 INFO L434 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-28 05:11:40,141 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 413 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:11:40,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 916 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 05:11:40,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-11-28 05:11:40,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 728. [2024-11-28 05:11:40,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 460 states have (on average 1.8434782608695652) internal successors, (848), 722 states have internal predecessors, (848), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:11:40,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 874 transitions. [2024-11-28 05:11:40,175 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 874 transitions. Word has length 6 [2024-11-28 05:11:40,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:11:40,175 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 874 transitions. [2024-11-28 05:11:40,175 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-28 05:11:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 874 transitions. [2024-11-28 05:11:40,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 05:11:40,176 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:11:40,176 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 05:11:40,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 05:11:40,176 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:11:40,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:40,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1423415127, now seen corresponding path program 1 times [2024-11-28 05:11:40,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:40,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42930259] [2024-11-28 05:11:40,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:40,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:40,244 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-28 05:11:40,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:40,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42930259] [2024-11-28 05:11:40,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42930259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:40,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:40,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:11:40,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838247191] [2024-11-28 05:11:40,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:40,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:11:40,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:40,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:11:40,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:11:40,251 INFO L87 Difference]: Start difference. First operand 728 states and 874 transitions. Second operand has 3 states, 3 states have (on average 2.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-28 05:11:40,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:11:40,310 INFO L93 Difference]: Finished difference Result 1406 states and 1678 transitions. [2024-11-28 05:11:40,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:11:40,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.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-28 05:11:40,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:11:40,317 INFO L225 Difference]: With dead ends: 1406 [2024-11-28 05:11:40,317 INFO L226 Difference]: Without dead ends: 1406 [2024-11-28 05:11:40,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:11:40,318 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 718 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:11:40,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 1580 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:11:40,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2024-11-28 05:11:40,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 729. [2024-11-28 05:11:40,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 461 states have (on average 1.841648590021692) internal successors, (849), 723 states have internal predecessors, (849), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:11:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 875 transitions. [2024-11-28 05:11:40,358 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 875 transitions. Word has length 6 [2024-11-28 05:11:40,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:11:40,358 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 875 transitions. [2024-11-28 05:11:40,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.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-28 05:11:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 875 transitions. [2024-11-28 05:11:40,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 05:11:40,359 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:11:40,359 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:40,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 05:11:40,360 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:11:40,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:40,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1783262039, now seen corresponding path program 1 times [2024-11-28 05:11:40,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:40,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179921744] [2024-11-28 05:11:40,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:40,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:40,499 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-28 05:11:40,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:40,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179921744] [2024-11-28 05:11:40,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179921744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:40,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:40,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:11:40,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27168934] [2024-11-28 05:11:40,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:40,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:11:40,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:40,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:11:40,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:11:40,501 INFO L87 Difference]: Start difference. First operand 729 states and 875 transitions. Second operand has 4 states, 3 states have (on average 4.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-28 05:11:41,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:11:41,300 INFO L93 Difference]: Finished difference Result 756 states and 929 transitions. [2024-11-28 05:11:41,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:11:41,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.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-28 05:11:41,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:11:41,305 INFO L225 Difference]: With dead ends: 756 [2024-11-28 05:11:41,305 INFO L226 Difference]: Without dead ends: 756 [2024-11-28 05:11:41,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:11:41,306 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 966 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:11:41,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 796 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 05:11:41,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-11-28 05:11:41,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 706. [2024-11-28 05:11:41,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 461 states have (on average 1.79175704989154) internal successors, (826), 700 states have internal predecessors, (826), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:11:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 852 transitions. [2024-11-28 05:11:41,338 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 852 transitions. Word has length 12 [2024-11-28 05:11:41,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:11:41,339 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 852 transitions. [2024-11-28 05:11:41,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.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-28 05:11:41,339 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 852 transitions. [2024-11-28 05:11:41,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 05:11:41,339 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:11:41,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:41,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 05:11:41,340 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:11:41,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:41,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1783262040, now seen corresponding path program 1 times [2024-11-28 05:11:41,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:41,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526588257] [2024-11-28 05:11:41,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:41,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:41,451 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-28 05:11:41,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:41,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526588257] [2024-11-28 05:11:41,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526588257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:41,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:41,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:11:41,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926518910] [2024-11-28 05:11:41,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:41,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:11:41,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:41,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:11:41,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:11:41,453 INFO L87 Difference]: Start difference. First operand 706 states and 852 transitions. Second operand has 3 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-28 05:11:41,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:11:41,493 INFO L93 Difference]: Finished difference Result 631 states and 749 transitions. [2024-11-28 05:11:41,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:11:41,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 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-28 05:11:41,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:11:41,498 INFO L225 Difference]: With dead ends: 631 [2024-11-28 05:11:41,498 INFO L226 Difference]: Without dead ends: 631 [2024-11-28 05:11:41,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:11:41,500 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 61 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:11:41,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1261 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:11:41,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-28 05:11:41,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2024-11-28 05:11:41,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 398 states have (on average 1.8165829145728642) internal successors, (723), 625 states have internal predecessors, (723), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:11:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 749 transitions. [2024-11-28 05:11:41,524 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 749 transitions. Word has length 12 [2024-11-28 05:11:41,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:11:41,525 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 749 transitions. [2024-11-28 05:11:41,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-28 05:11:41,525 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 749 transitions. [2024-11-28 05:11:41,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-28 05:11:41,525 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:11:41,525 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:41,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 05:11:41,525 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:11:41,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:41,526 INFO L85 PathProgramCache]: Analyzing trace with hash 23145585, now seen corresponding path program 1 times [2024-11-28 05:11:41,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:41,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85144618] [2024-11-28 05:11:41,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:41,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:41,638 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-28 05:11:41,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:41,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85144618] [2024-11-28 05:11:41,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85144618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:41,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:41,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:11:41,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423715926] [2024-11-28 05:11:41,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:41,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:11:41,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:41,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:11:41,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:11:41,639 INFO L87 Difference]: Start difference. First operand 631 states and 749 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-28 05:11:41,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:11:41,725 INFO L93 Difference]: Finished difference Result 613 states and 724 transitions. [2024-11-28 05:11:41,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:11:41,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-28 05:11:41,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:11:41,729 INFO L225 Difference]: With dead ends: 613 [2024-11-28 05:11:41,729 INFO L226 Difference]: Without dead ends: 613 [2024-11-28 05:11:41,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:11:41,730 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 41 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:11:41,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1838 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:11:41,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-28 05:11:41,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 610. [2024-11-28 05:11:41,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 384 states have (on average 1.8098958333333333) internal successors, (695), 604 states have internal predecessors, (695), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:11:41,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 721 transitions. [2024-11-28 05:11:41,750 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 721 transitions. Word has length 14 [2024-11-28 05:11:41,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:11:41,750 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 721 transitions. [2024-11-28 05:11:41,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-28 05:11:41,750 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 721 transitions. [2024-11-28 05:11:41,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 05:11:41,751 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:11:41,751 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:41,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 05:11:41,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:11:41,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:41,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1739855297, now seen corresponding path program 1 times [2024-11-28 05:11:41,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:41,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105776083] [2024-11-28 05:11:41,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:41,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:41,962 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-28 05:11:41,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:41,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105776083] [2024-11-28 05:11:41,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105776083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:41,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:41,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:11:41,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415330040] [2024-11-28 05:11:41,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:41,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:11:41,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:41,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:11:41,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:11:41,963 INFO L87 Difference]: Start difference. First operand 610 states and 721 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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-28 05:11:42,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:11:42,634 INFO L93 Difference]: Finished difference Result 704 states and 809 transitions. [2024-11-28 05:11:42,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:11:42,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-28 05:11:42,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:11:42,638 INFO L225 Difference]: With dead ends: 704 [2024-11-28 05:11:42,638 INFO L226 Difference]: Without dead ends: 704 [2024-11-28 05:11:42,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:11:42,638 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 418 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:11:42,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1141 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 05:11:42,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2024-11-28 05:11:42,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 606. [2024-11-28 05:11:42,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 384 states have (on average 1.7994791666666667) internal successors, (691), 600 states have internal predecessors, (691), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:11:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 717 transitions. [2024-11-28 05:11:42,654 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 717 transitions. Word has length 28 [2024-11-28 05:11:42,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:11:42,655 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 717 transitions. [2024-11-28 05:11:42,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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-28 05:11:42,655 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 717 transitions. [2024-11-28 05:11:42,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-28 05:11:42,658 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:11:42,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:42,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 05:11:42,659 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:11:42,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:42,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1055550923, now seen corresponding path program 1 times [2024-11-28 05:11:42,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:42,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861206027] [2024-11-28 05:11:42,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:42,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:42,819 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-28 05:11:42,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:42,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861206027] [2024-11-28 05:11:42,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861206027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:42,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:42,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:11:42,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310679498] [2024-11-28 05:11:42,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:42,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:11:42,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:42,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:11:42,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:11:42,820 INFO L87 Difference]: Start difference. First operand 606 states and 717 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:42,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:11:42,889 INFO L93 Difference]: Finished difference Result 606 states and 713 transitions. [2024-11-28 05:11:42,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:11:42,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-28 05:11:42,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:11:42,892 INFO L225 Difference]: With dead ends: 606 [2024-11-28 05:11:42,892 INFO L226 Difference]: Without dead ends: 606 [2024-11-28 05:11:42,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:11:42,894 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 21 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:11:42,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1820 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:11:42,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-28 05:11:42,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-28 05:11:42,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 384 states have (on average 1.7890625) internal successors, (687), 600 states have internal predecessors, (687), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:11:42,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 713 transitions. [2024-11-28 05:11:42,910 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 713 transitions. Word has length 62 [2024-11-28 05:11:42,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:11:42,912 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 713 transitions. [2024-11-28 05:11:42,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:42,912 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 713 transitions. [2024-11-28 05:11:42,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 05:11:42,915 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:11:42,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:42,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 05:11:42,918 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:11:42,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:42,918 INFO L85 PathProgramCache]: Analyzing trace with hash -680482047, now seen corresponding path program 1 times [2024-11-28 05:11:42,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:42,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43279079] [2024-11-28 05:11:42,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:42,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:43,106 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-28 05:11:43,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:43,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43279079] [2024-11-28 05:11:43,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43279079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:43,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:43,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:11:43,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968939319] [2024-11-28 05:11:43,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:43,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:11:43,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:43,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:11:43,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:11:43,107 INFO L87 Difference]: Start difference. First operand 606 states and 713 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:43,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:11:43,164 INFO L93 Difference]: Finished difference Result 699 states and 833 transitions. [2024-11-28 05:11:43,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:11:43,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-28 05:11:43,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:11:43,167 INFO L225 Difference]: With dead ends: 699 [2024-11-28 05:11:43,167 INFO L226 Difference]: Without dead ends: 699 [2024-11-28 05:11:43,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:11:43,169 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 54 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:11:43,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1236 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:11:43,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-28 05:11:43,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2024-11-28 05:11:43,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 477 states have (on average 1.6918238993710693) internal successors, (807), 693 states have internal predecessors, (807), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:11:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 833 transitions. [2024-11-28 05:11:43,191 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 833 transitions. Word has length 70 [2024-11-28 05:11:43,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:11:43,192 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 833 transitions. [2024-11-28 05:11:43,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:43,192 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 833 transitions. [2024-11-28 05:11:43,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-28 05:11:43,195 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:11:43,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:43,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 05:11:43,196 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:11:43,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:43,196 INFO L85 PathProgramCache]: Analyzing trace with hash -104075831, now seen corresponding path program 1 times [2024-11-28 05:11:43,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:43,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32398212] [2024-11-28 05:11:43,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:43,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:44,002 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-28 05:11:44,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:44,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32398212] [2024-11-28 05:11:44,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32398212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:44,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:44,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:11:44,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905033236] [2024-11-28 05:11:44,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:44,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:11:44,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:44,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:11:44,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:11:44,004 INFO L87 Difference]: Start difference. First operand 699 states and 833 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:44,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:11:44,795 INFO L93 Difference]: Finished difference Result 661 states and 795 transitions. [2024-11-28 05:11:44,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:11:44,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-28 05:11:44,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:11:44,798 INFO L225 Difference]: With dead ends: 661 [2024-11-28 05:11:44,798 INFO L226 Difference]: Without dead ends: 661 [2024-11-28 05:11:44,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:11:44,799 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 916 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:11:44,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 542 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 05:11:44,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-11-28 05:11:44,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 621. [2024-11-28 05:11:44,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 437 states have (on average 1.5789473684210527) internal successors, (690), 615 states have internal predecessors, (690), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:11:44,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 716 transitions. [2024-11-28 05:11:44,813 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 716 transitions. Word has length 73 [2024-11-28 05:11:44,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:11:44,813 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 716 transitions. [2024-11-28 05:11:44,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:44,813 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 716 transitions. [2024-11-28 05:11:44,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-28 05:11:44,814 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:11:44,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:44,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 05:11:44,815 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:11:44,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:44,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1353945236, now seen corresponding path program 1 times [2024-11-28 05:11:44,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:44,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213733503] [2024-11-28 05:11:44,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:44,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:45,178 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-28 05:11:45,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:45,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213733503] [2024-11-28 05:11:45,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213733503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:45,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:45,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:11:45,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388247998] [2024-11-28 05:11:45,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:45,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:11:45,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:45,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:11:45,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:11:45,180 INFO L87 Difference]: Start difference. First operand 621 states and 716 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:45,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:11:45,849 INFO L93 Difference]: Finished difference Result 620 states and 715 transitions. [2024-11-28 05:11:45,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:11:45,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-28 05:11:45,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:11:45,852 INFO L225 Difference]: With dead ends: 620 [2024-11-28 05:11:45,852 INFO L226 Difference]: Without dead ends: 620 [2024-11-28 05:11:45,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:11:45,853 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 2 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:11:45,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1673 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 05:11:45,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-28 05:11:45,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2024-11-28 05:11:45,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 437 states have (on average 1.5766590389016018) internal successors, (689), 614 states have internal predecessors, (689), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:11:45,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 715 transitions. [2024-11-28 05:11:45,867 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 715 transitions. Word has length 78 [2024-11-28 05:11:45,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:11:45,868 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 715 transitions. [2024-11-28 05:11:45,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:45,868 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 715 transitions. [2024-11-28 05:11:45,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-28 05:11:45,869 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:11:45,869 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:45,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 05:11:45,869 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:11:45,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:45,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1353945237, now seen corresponding path program 1 times [2024-11-28 05:11:45,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:45,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680413140] [2024-11-28 05:11:45,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:45,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:46,465 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-28 05:11:46,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:46,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680413140] [2024-11-28 05:11:46,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680413140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:46,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:46,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:11:46,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540702026] [2024-11-28 05:11:46,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:46,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:11:46,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:46,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:11:46,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:11:46,469 INFO L87 Difference]: Start difference. First operand 620 states and 715 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:47,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:11:47,218 INFO L93 Difference]: Finished difference Result 619 states and 714 transitions. [2024-11-28 05:11:47,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:11:47,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-28 05:11:47,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:11:47,221 INFO L225 Difference]: With dead ends: 619 [2024-11-28 05:11:47,221 INFO L226 Difference]: Without dead ends: 619 [2024-11-28 05:11:47,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:11:47,222 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 1 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:11:47,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1680 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 05:11:47,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-28 05:11:47,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2024-11-28 05:11:47,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 436 states have (on average 1.5779816513761469) internal successors, (688), 613 states have internal predecessors, (688), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:11:47,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 714 transitions. [2024-11-28 05:11:47,239 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 714 transitions. Word has length 78 [2024-11-28 05:11:47,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:11:47,239 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 714 transitions. [2024-11-28 05:11:47,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:47,240 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 714 transitions. [2024-11-28 05:11:47,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-28 05:11:47,240 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:11:47,241 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:47,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 05:11:47,241 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:11:47,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:47,243 INFO L85 PathProgramCache]: Analyzing trace with hash -474028485, now seen corresponding path program 1 times [2024-11-28 05:11:47,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:47,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437524617] [2024-11-28 05:11:47,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:47,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:47,544 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-28 05:11:47,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:47,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437524617] [2024-11-28 05:11:47,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437524617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:47,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:47,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 05:11:47,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32932895] [2024-11-28 05:11:47,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:47,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:11:47,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:47,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:11:47,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:11:47,547 INFO L87 Difference]: Start difference. First operand 619 states and 714 transitions. Second operand has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:11:48,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:11:48,535 INFO L93 Difference]: Finished difference Result 631 states and 729 transitions. [2024-11-28 05:11:48,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:11:48,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2024-11-28 05:11:48,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:11:48,538 INFO L225 Difference]: With dead ends: 631 [2024-11-28 05:11:48,538 INFO L226 Difference]: Without dead ends: 631 [2024-11-28 05:11:48,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:11:48,540 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 12 mSDsluCounter, 1925 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:11:48,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2501 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 05:11:48,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-28 05:11:48,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 625. [2024-11-28 05:11:48,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 441 states have (on average 1.5759637188208617) internal successors, (695), 618 states have internal predecessors, (695), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-28 05:11:48,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 724 transitions. [2024-11-28 05:11:48,555 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 724 transitions. Word has length 86 [2024-11-28 05:11:48,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:11:48,555 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 724 transitions. [2024-11-28 05:11:48,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:11:48,555 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 724 transitions. [2024-11-28 05:11:48,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-28 05:11:48,556 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:11:48,556 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:48,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 05:11:48,556 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:11:48,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:48,557 INFO L85 PathProgramCache]: Analyzing trace with hash -474028484, now seen corresponding path program 1 times [2024-11-28 05:11:48,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:48,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722139302] [2024-11-28 05:11:48,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:48,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:49,245 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-28 05:11:49,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:49,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722139302] [2024-11-28 05:11:49,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722139302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:49,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:49,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:11:49,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216505883] [2024-11-28 05:11:49,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:49,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:11:49,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:49,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:11:49,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:11:49,246 INFO L87 Difference]: Start difference. First operand 625 states and 724 transitions. Second operand has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:11:50,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:11:50,100 INFO L93 Difference]: Finished difference Result 625 states and 723 transitions. [2024-11-28 05:11:50,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:11:50,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2024-11-28 05:11:50,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:11:50,103 INFO L225 Difference]: With dead ends: 625 [2024-11-28 05:11:50,103 INFO L226 Difference]: Without dead ends: 625 [2024-11-28 05:11:50,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:11:50,104 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 7 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2077 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:11:50,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2077 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 05:11:50,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-11-28 05:11:50,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2024-11-28 05:11:50,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 441 states have (on average 1.5736961451247165) internal successors, (694), 618 states have internal predecessors, (694), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-28 05:11:50,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 723 transitions. [2024-11-28 05:11:50,117 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 723 transitions. Word has length 86 [2024-11-28 05:11:50,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:11:50,117 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 723 transitions. [2024-11-28 05:11:50,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:11:50,118 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 723 transitions. [2024-11-28 05:11:50,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-28 05:11:50,118 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:11:50,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:50,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 05:11:50,119 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:11:50,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:50,119 INFO L85 PathProgramCache]: Analyzing trace with hash -583308546, now seen corresponding path program 1 times [2024-11-28 05:11:50,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:50,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652938445] [2024-11-28 05:11:50,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:50,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:50,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:11:50,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:50,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652938445] [2024-11-28 05:11:50,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652938445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:11:50,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580293756] [2024-11-28 05:11:50,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:50,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:11:50,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:11:50,688 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:11:50,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 05:11:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:50,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 05:11:50,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:11:50,947 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-28 05:11:51,104 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:11:51,104 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 11 treesize of output 11 [2024-11-28 05:11:51,124 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-28 05:11:51,207 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:11:51,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 05:11:51,248 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-28 05:11:51,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:11:51,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:11:51,312 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-28 05:11:51,312 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 21 treesize of output 20 [2024-11-28 05:11:51,327 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_501) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2024-11-28 05:11:51,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580293756] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:11:51,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:11:51,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2024-11-28 05:11:51,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127634127] [2024-11-28 05:11:51,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:11:51,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 05:11:51,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:51,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 05:11:51,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2024-11-28 05:11:51,331 INFO L87 Difference]: Start difference. First operand 625 states and 723 transitions. Second operand has 14 states, 12 states have (on average 10.333333333333334) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 05:11:53,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:11:53,557 INFO L93 Difference]: Finished difference Result 624 states and 722 transitions. [2024-11-28 05:11:53,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 05:11:53,558 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.333333333333334) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 87 [2024-11-28 05:11:53,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:11:53,560 INFO L225 Difference]: With dead ends: 624 [2024-11-28 05:11:53,560 INFO L226 Difference]: Without dead ends: 624 [2024-11-28 05:11:53,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=342, Unknown=1, NotChecked=38, Total=462 [2024-11-28 05:11:53,562 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 500 mSDsluCounter, 3257 mSDsCounter, 0 mSdLazyCounter, 2804 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 3618 SdHoareTripleChecker+Invalid, 2828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:11:53,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 3618 Invalid, 2828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2804 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-28 05:11:53,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2024-11-28 05:11:53,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2024-11-28 05:11:53,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 441 states have (on average 1.5714285714285714) internal successors, (693), 617 states have internal predecessors, (693), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-28 05:11:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 722 transitions. [2024-11-28 05:11:53,578 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 722 transitions. Word has length 87 [2024-11-28 05:11:53,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:11:53,578 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 722 transitions. [2024-11-28 05:11:53,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.333333333333334) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 05:11:53,578 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 722 transitions. [2024-11-28 05:11:53,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-28 05:11:53,579 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:11:53,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:53,590 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 05:11:53,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-28 05:11:53,780 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:11:53,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:53,781 INFO L85 PathProgramCache]: Analyzing trace with hash -583308545, now seen corresponding path program 1 times [2024-11-28 05:11:53,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:53,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625961455] [2024-11-28 05:11:53,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:53,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:54,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:11:54,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:54,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625961455] [2024-11-28 05:11:54,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625961455] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:11:54,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427314441] [2024-11-28 05:11:54,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:54,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:11:54,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:11:54,660 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:11:54,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 05:11:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:54,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-28 05:11:54,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:11:54,880 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-28 05:11:55,052 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:11:55,052 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 11 treesize of output 11 [2024-11-28 05:11:55,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-28 05:11:55,101 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-28 05:11:55,112 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-28 05:11:55,231 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 22 treesize of output 10 [2024-11-28 05:11:55,237 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-28 05:11:55,406 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:11:55,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:11:55,414 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 30 treesize of output 13 [2024-11-28 05:11:55,477 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-28 05:11:55,484 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-28 05:11:55,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:11:55,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:11:55,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427314441] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:11:55,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:11:55,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-28 05:11:55,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942896377] [2024-11-28 05:11:55,699 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:11:55,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 05:11:55,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:55,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 05:11:55,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=352, Unknown=7, NotChecked=0, Total=420 [2024-11-28 05:11:55,700 INFO L87 Difference]: Start difference. First operand 624 states and 722 transitions. Second operand has 18 states, 15 states have (on average 9.066666666666666) internal successors, (136), 18 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:11:58,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:11:58,708 INFO L93 Difference]: Finished difference Result 631 states and 729 transitions. [2024-11-28 05:11:58,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:11:58,709 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.066666666666666) internal successors, (136), 18 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 87 [2024-11-28 05:11:58,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:11:58,711 INFO L225 Difference]: With dead ends: 631 [2024-11-28 05:11:58,711 INFO L226 Difference]: Without dead ends: 631 [2024-11-28 05:11:58,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=498, Unknown=7, NotChecked=0, Total=600 [2024-11-28 05:11:58,713 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 498 mSDsluCounter, 2539 mSDsCounter, 0 mSdLazyCounter, 3000 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 2902 SdHoareTripleChecker+Invalid, 3028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:11:58,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 2902 Invalid, 3028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3000 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-28 05:11:58,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-28 05:11:58,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 622. [2024-11-28 05:11:58,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 440 states have (on average 1.5704545454545455) internal successors, (691), 615 states have internal predecessors, (691), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:11:58,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 717 transitions. [2024-11-28 05:11:58,728 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 717 transitions. Word has length 87 [2024-11-28 05:11:58,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:11:58,729 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 717 transitions. [2024-11-28 05:11:58,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.066666666666666) internal successors, (136), 18 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:11:58,729 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 717 transitions. [2024-11-28 05:11:58,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-28 05:11:58,730 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:11:58,730 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:58,742 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 05:11:58,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-28 05:11:58,934 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:11:58,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:58,936 INFO L85 PathProgramCache]: Analyzing trace with hash 70484336, now seen corresponding path program 1 times [2024-11-28 05:11:58,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:58,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823060914] [2024-11-28 05:11:58,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:58,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:59,623 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-28 05:11:59,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:59,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823060914] [2024-11-28 05:11:59,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823060914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:59,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:59,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 05:11:59,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891876332] [2024-11-28 05:11:59,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:59,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 05:11:59,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:59,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 05:11:59,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-28 05:11:59,626 INFO L87 Difference]: Start difference. First operand 622 states and 717 transitions. Second operand has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:12:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:12:01,081 INFO L93 Difference]: Finished difference Result 635 states and 733 transitions. [2024-11-28 05:12:01,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 05:12:01,082 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-28 05:12:01,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:12:01,085 INFO L225 Difference]: With dead ends: 635 [2024-11-28 05:12:01,085 INFO L226 Difference]: Without dead ends: 635 [2024-11-28 05:12:01,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-28 05:12:01,086 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 511 mSDsluCounter, 2302 mSDsCounter, 0 mSdLazyCounter, 2094 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 2662 SdHoareTripleChecker+Invalid, 2118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:12:01,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 2662 Invalid, 2118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2094 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-28 05:12:01,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-28 05:12:01,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 631. [2024-11-28 05:12:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 448 states have (on average 1.5647321428571428) internal successors, (701), 623 states have internal predecessors, (701), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:12:01,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 728 transitions. [2024-11-28 05:12:01,103 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 728 transitions. Word has length 89 [2024-11-28 05:12:01,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:12:01,103 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 728 transitions. [2024-11-28 05:12:01,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:12:01,104 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 728 transitions. [2024-11-28 05:12:01,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-28 05:12:01,107 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:12:01,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:01,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 05:12:01,108 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:12:01,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:01,110 INFO L85 PathProgramCache]: Analyzing trace with hash 70484337, now seen corresponding path program 1 times [2024-11-28 05:12:01,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:01,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415116070] [2024-11-28 05:12:01,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:01,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:02,042 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-28 05:12:02,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:02,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415116070] [2024-11-28 05:12:02,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415116070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:02,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:02,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 05:12:02,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217503526] [2024-11-28 05:12:02,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:02,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 05:12:02,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:02,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 05:12:02,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 05:12:02,044 INFO L87 Difference]: Start difference. First operand 631 states and 728 transitions. Second operand has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:12:04,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:12:04,376 INFO L93 Difference]: Finished difference Result 634 states and 732 transitions. [2024-11-28 05:12:04,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 05:12:04,377 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-28 05:12:04,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:12:04,379 INFO L225 Difference]: With dead ends: 634 [2024-11-28 05:12:04,379 INFO L226 Difference]: Without dead ends: 634 [2024-11-28 05:12:04,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-28 05:12:04,380 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 521 mSDsluCounter, 1951 mSDsCounter, 0 mSdLazyCounter, 2407 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 2315 SdHoareTripleChecker+Invalid, 2429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:12:04,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 2315 Invalid, 2429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2407 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-28 05:12:04,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-28 05:12:04,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 631. [2024-11-28 05:12:04,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 448 states have (on average 1.5625) internal successors, (700), 623 states have internal predecessors, (700), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:12:04,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 727 transitions. [2024-11-28 05:12:04,401 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 727 transitions. Word has length 89 [2024-11-28 05:12:04,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:12:04,401 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 727 transitions. [2024-11-28 05:12:04,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:12:04,401 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 727 transitions. [2024-11-28 05:12:04,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-28 05:12:04,403 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:12:04,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:04,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 05:12:04,403 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:12:04,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:04,403 INFO L85 PathProgramCache]: Analyzing trace with hash 93397453, now seen corresponding path program 1 times [2024-11-28 05:12:04,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:04,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458765613] [2024-11-28 05:12:04,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:04,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:05,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:05,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:05,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458765613] [2024-11-28 05:12:05,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458765613] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:12:05,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326518489] [2024-11-28 05:12:05,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:05,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:12:05,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:12:05,178 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:12:05,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 05:12:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:05,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-28 05:12:05,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:12:05,479 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-28 05:12:05,643 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:12:05,643 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 11 treesize of output 11 [2024-11-28 05:12:05,653 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-28 05:12:05,752 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:05,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 05:12:05,828 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:05,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 05:12:05,852 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-28 05:12:05,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:05,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:12:05,874 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_880) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-28 05:12:05,884 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 05:12:05,942 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-28 05:12:05,942 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 33 treesize of output 32 [2024-11-28 05:12:06,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326518489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:12:06,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:12:06,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2024-11-28 05:12:06,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988658261] [2024-11-28 05:12:06,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:12:06,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 05:12:06,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:06,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 05:12:06,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=223, Unknown=9, NotChecked=62, Total=342 [2024-11-28 05:12:06,007 INFO L87 Difference]: Start difference. First operand 631 states and 727 transitions. Second operand has 16 states, 14 states have (on average 9.214285714285714) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:12:07,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:12:07,959 INFO L93 Difference]: Finished difference Result 633 states and 731 transitions. [2024-11-28 05:12:07,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 05:12:07,959 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.214285714285714) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-11-28 05:12:07,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:12:07,962 INFO L225 Difference]: With dead ends: 633 [2024-11-28 05:12:07,962 INFO L226 Difference]: Without dead ends: 633 [2024-11-28 05:12:07,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=451, Unknown=9, NotChecked=90, Total=650 [2024-11-28 05:12:07,963 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 498 mSDsluCounter, 3248 mSDsCounter, 0 mSdLazyCounter, 2800 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 3608 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:12:07,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 3608 Invalid, 2823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2800 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-28 05:12:07,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-28 05:12:07,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 630. [2024-11-28 05:12:07,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 448 states have (on average 1.5602678571428572) internal successors, (699), 622 states have internal predecessors, (699), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:12:07,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 726 transitions. [2024-11-28 05:12:07,979 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 726 transitions. Word has length 90 [2024-11-28 05:12:07,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:12:07,982 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 726 transitions. [2024-11-28 05:12:07,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.214285714285714) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:12:07,982 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 726 transitions. [2024-11-28 05:12:07,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-28 05:12:07,983 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:12:07,983 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:07,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 05:12:08,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:12:08,187 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:12:08,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:08,188 INFO L85 PathProgramCache]: Analyzing trace with hash 93397454, now seen corresponding path program 1 times [2024-11-28 05:12:08,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:08,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383664858] [2024-11-28 05:12:08,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:08,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:09,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:09,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:09,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383664858] [2024-11-28 05:12:09,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383664858] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:12:09,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461240480] [2024-11-28 05:12:09,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:09,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:12:09,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:12:09,108 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:12:09,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 05:12:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:09,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 05:12:09,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:12:09,361 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-28 05:12:09,525 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 8 treesize of output 1 [2024-11-28 05:12:09,536 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:12:09,536 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 11 treesize of output 11 [2024-11-28 05:12:09,576 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-28 05:12:09,583 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-28 05:12:09,713 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 22 treesize of output 10 [2024-11-28 05:12:09,719 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-28 05:12:09,873 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:09,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:12:09,880 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 30 treesize of output 13 [2024-11-28 05:12:09,992 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:09,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:12:10,003 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 30 treesize of output 13 [2024-11-28 05:12:10,025 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-28 05:12:10,030 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-28 05:12:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:10,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:12:10,149 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1021 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1020 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 05:12:10,305 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1027) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1026) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1021 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1026))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1027) .cse1 v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1021) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-28 05:12:10,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461240480] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:12:10,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:12:10,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-11-28 05:12:10,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873660269] [2024-11-28 05:12:10,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:12:10,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 05:12:10,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:10,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 05:12:10,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=422, Unknown=14, NotChecked=86, Total=600 [2024-11-28 05:12:10,312 INFO L87 Difference]: Start difference. First operand 630 states and 726 transitions. Second operand has 20 states, 17 states have (on average 8.352941176470589) internal successors, (142), 20 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:12:12,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:12:12,619 INFO L93 Difference]: Finished difference Result 632 states and 730 transitions. [2024-11-28 05:12:12,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 05:12:12,620 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.352941176470589) internal successors, (142), 20 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 90 [2024-11-28 05:12:12,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:12:12,622 INFO L225 Difference]: With dead ends: 632 [2024-11-28 05:12:12,622 INFO L226 Difference]: Without dead ends: 632 [2024-11-28 05:12:12,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=625, Unknown=14, NotChecked=106, Total=870 [2024-11-28 05:12:12,623 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 504 mSDsluCounter, 2478 mSDsCounter, 0 mSdLazyCounter, 3083 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 2840 SdHoareTripleChecker+Invalid, 3123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:12:12,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 2840 Invalid, 3123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3083 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 05:12:12,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-28 05:12:12,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 620. [2024-11-28 05:12:12,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 440 states have (on average 1.565909090909091) internal successors, (689), 613 states have internal predecessors, (689), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:12:12,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 715 transitions. [2024-11-28 05:12:12,636 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 715 transitions. Word has length 90 [2024-11-28 05:12:12,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:12:12,636 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 715 transitions. [2024-11-28 05:12:12,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.352941176470589) internal successors, (142), 20 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:12:12,637 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 715 transitions. [2024-11-28 05:12:12,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-28 05:12:12,637 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:12:12,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:12,649 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 05:12:12,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:12:12,842 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:12:12,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:12,843 INFO L85 PathProgramCache]: Analyzing trace with hash -439535294, now seen corresponding path program 1 times [2024-11-28 05:12:12,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:12,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20945692] [2024-11-28 05:12:12,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:12,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:13,544 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-28 05:12:13,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:13,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20945692] [2024-11-28 05:12:13,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20945692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:13,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:13,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 05:12:13,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568654851] [2024-11-28 05:12:13,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:13,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 05:12:13,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:13,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 05:12:13,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-28 05:12:13,547 INFO L87 Difference]: Start difference. First operand 620 states and 715 transitions. Second operand has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:12:15,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:12:15,290 INFO L93 Difference]: Finished difference Result 636 states and 734 transitions. [2024-11-28 05:12:15,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 05:12:15,291 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-28 05:12:15,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:12:15,293 INFO L225 Difference]: With dead ends: 636 [2024-11-28 05:12:15,293 INFO L226 Difference]: Without dead ends: 636 [2024-11-28 05:12:15,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-28 05:12:15,295 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 512 mSDsluCounter, 2912 mSDsCounter, 0 mSdLazyCounter, 2624 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 3271 SdHoareTripleChecker+Invalid, 2648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:12:15,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 3271 Invalid, 2648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2624 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-28 05:12:15,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-28 05:12:15,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 632. [2024-11-28 05:12:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 451 states have (on average 1.5565410199556542) internal successors, (702), 624 states have internal predecessors, (702), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:12:15,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 729 transitions. [2024-11-28 05:12:15,308 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 729 transitions. Word has length 92 [2024-11-28 05:12:15,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:12:15,308 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 729 transitions. [2024-11-28 05:12:15,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:12:15,308 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 729 transitions. [2024-11-28 05:12:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-28 05:12:15,309 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:12:15,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:15,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 05:12:15,310 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:12:15,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:15,310 INFO L85 PathProgramCache]: Analyzing trace with hash -439535293, now seen corresponding path program 1 times [2024-11-28 05:12:15,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:15,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617567059] [2024-11-28 05:12:15,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:15,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:16,226 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-28 05:12:16,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:16,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617567059] [2024-11-28 05:12:16,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617567059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:16,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:16,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 05:12:16,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165628763] [2024-11-28 05:12:16,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:16,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 05:12:16,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:16,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 05:12:16,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:12:16,229 INFO L87 Difference]: Start difference. First operand 632 states and 729 transitions. Second operand has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:12:17,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:12:17,808 INFO L93 Difference]: Finished difference Result 635 states and 733 transitions. [2024-11-28 05:12:17,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:12:17,808 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-28 05:12:17,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:12:17,811 INFO L225 Difference]: With dead ends: 635 [2024-11-28 05:12:17,811 INFO L226 Difference]: Without dead ends: 635 [2024-11-28 05:12:17,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-28 05:12:17,811 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 505 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 2014 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 2036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:12:17,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 2102 Invalid, 2036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2014 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 05:12:17,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-28 05:12:17,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 632. [2024-11-28 05:12:17,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 451 states have (on average 1.5543237250554325) internal successors, (701), 624 states have internal predecessors, (701), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:12:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 728 transitions. [2024-11-28 05:12:17,824 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 728 transitions. Word has length 92 [2024-11-28 05:12:17,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:12:17,824 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 728 transitions. [2024-11-28 05:12:17,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:12:17,825 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 728 transitions. [2024-11-28 05:12:17,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-28 05:12:17,826 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:12:17,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:17,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 05:12:17,826 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:12:17,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:17,827 INFO L85 PathProgramCache]: Analyzing trace with hash -734666811, now seen corresponding path program 1 times [2024-11-28 05:12:17,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:17,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641880438] [2024-11-28 05:12:17,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:17,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:18,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:18,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:18,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641880438] [2024-11-28 05:12:18,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641880438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:12:18,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390343785] [2024-11-28 05:12:18,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:18,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:12:18,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:12:18,602 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:12:18,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 05:12:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:18,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-28 05:12:18,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:12:18,904 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-28 05:12:19,058 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:12:19,059 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 11 treesize of output 11 [2024-11-28 05:12:19,067 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-28 05:12:19,142 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:19,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 05:12:19,210 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:19,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 05:12:19,280 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:19,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 05:12:19,312 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-28 05:12:19,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:19,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:12:19,330 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1301 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1301) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-28 05:12:19,388 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1301 (Array Int Int)) (v_ArrVal_1300 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1300))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1301)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 05:12:19,503 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-28 05:12:19,504 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 57 treesize of output 56 [2024-11-28 05:12:19,512 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1304 (Array Int Int)) (v_ArrVal_1301 (Array Int Int)) (v_ArrVal_1300 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1304))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1300)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1301)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-28 05:12:19,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390343785] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:12:19,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:12:19,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 17 [2024-11-28 05:12:19,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114531501] [2024-11-28 05:12:19,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:12:19,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 05:12:19,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:19,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 05:12:19,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=12, NotChecked=114, Total=506 [2024-11-28 05:12:19,519 INFO L87 Difference]: Start difference. First operand 632 states and 728 transitions. Second operand has 18 states, 16 states have (on average 8.375) internal successors, (134), 17 states have internal predecessors, (134), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:12:21,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:12:21,522 INFO L93 Difference]: Finished difference Result 634 states and 732 transitions. [2024-11-28 05:12:21,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 05:12:21,522 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.375) internal successors, (134), 17 states have internal predecessors, (134), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-28 05:12:21,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:12:21,525 INFO L225 Difference]: With dead ends: 634 [2024-11-28 05:12:21,525 INFO L226 Difference]: Without dead ends: 634 [2024-11-28 05:12:21,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=12, NotChecked=162, Total=930 [2024-11-28 05:12:21,526 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 492 mSDsluCounter, 3261 mSDsCounter, 0 mSdLazyCounter, 2845 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 3620 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:12:21,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 3620 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2845 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-28 05:12:21,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-28 05:12:21,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 631. [2024-11-28 05:12:21,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 451 states have (on average 1.5521064301552105) internal successors, (700), 623 states have internal predecessors, (700), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:12:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 727 transitions. [2024-11-28 05:12:21,539 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 727 transitions. Word has length 93 [2024-11-28 05:12:21,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:12:21,540 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 727 transitions. [2024-11-28 05:12:21,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.375) internal successors, (134), 17 states have internal predecessors, (134), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:12:21,540 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 727 transitions. [2024-11-28 05:12:21,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-28 05:12:21,541 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:12:21,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:21,555 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 05:12:21,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:12:21,746 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:12:21,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:21,747 INFO L85 PathProgramCache]: Analyzing trace with hash -734666810, now seen corresponding path program 1 times [2024-11-28 05:12:21,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:21,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675591008] [2024-11-28 05:12:21,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:21,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:22,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:22,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:22,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675591008] [2024-11-28 05:12:22,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675591008] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:12:22,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511532934] [2024-11-28 05:12:22,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:22,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:12:22,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:12:22,766 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:12:22,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 05:12:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:23,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-28 05:12:23,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:12:23,071 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-28 05:12:23,201 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:12:23,202 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 11 treesize of output 11 [2024-11-28 05:12:23,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-28 05:12:23,237 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 19 treesize of output 1 [2024-11-28 05:12:23,241 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-28 05:12:23,349 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 22 treesize of output 10 [2024-11-28 05:12:23,355 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-28 05:12:23,487 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:23,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:12:23,499 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 30 treesize of output 13 [2024-11-28 05:12:23,596 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:23,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:12:23,606 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 30 treesize of output 13 [2024-11-28 05:12:23,702 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:23,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:12:23,708 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 41 treesize of output 22 [2024-11-28 05:12:23,783 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-28 05:12:23,791 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 30 treesize of output 12 [2024-11-28 05:12:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:23,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:12:24,098 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1454))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (<= 0 (+ 8 (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) (forall ((v_ArrVal_1454 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1454))) (or (forall ((v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1453))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store .cse2 .cse3 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (< (+ (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0)))))) is different from false [2024-11-28 05:12:24,368 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1462))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1461) .cse3 v_ArrVal_1454))) (or (< (+ 4 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 (select (select (store .cse2 .cse3 v_ArrVal_1453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))))) (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1462))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1461) .cse8 v_ArrVal_1454))) (or (< (+ 4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (let ((.cse6 (store .cse7 .cse8 v_ArrVal_1453))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse4 .cse5 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) is different from false [2024-11-28 05:12:24,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511532934] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:12:24,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:12:24,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2024-11-28 05:12:24,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893253535] [2024-11-28 05:12:24,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:12:24,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-28 05:12:24,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:24,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-28 05:12:24,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=8, NotChecked=106, Total=870 [2024-11-28 05:12:24,378 INFO L87 Difference]: Start difference. First operand 631 states and 727 transitions. Second operand has 23 states, 20 states have (on average 7.4) internal successors, (148), 23 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:12:27,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:12:27,712 INFO L93 Difference]: Finished difference Result 633 states and 731 transitions. [2024-11-28 05:12:27,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 05:12:27,712 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.4) internal successors, (148), 23 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 93 [2024-11-28 05:12:27,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:12:27,714 INFO L225 Difference]: With dead ends: 633 [2024-11-28 05:12:27,715 INFO L226 Difference]: Without dead ends: 633 [2024-11-28 05:12:27,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=178, Invalid=944, Unknown=8, NotChecked=130, Total=1260 [2024-11-28 05:12:27,716 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 495 mSDsluCounter, 3868 mSDsCounter, 0 mSdLazyCounter, 4542 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 4229 SdHoareTripleChecker+Invalid, 4570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:12:27,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 4229 Invalid, 4570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4542 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-28 05:12:27,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-28 05:12:27,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 618. [2024-11-28 05:12:27,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 440 states have (on average 1.5613636363636363) internal successors, (687), 611 states have internal predecessors, (687), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:12:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 713 transitions. [2024-11-28 05:12:27,729 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 713 transitions. Word has length 93 [2024-11-28 05:12:27,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:12:27,729 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 713 transitions. [2024-11-28 05:12:27,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.4) internal successors, (148), 23 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:12:27,730 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 713 transitions. [2024-11-28 05:12:27,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-28 05:12:27,733 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:12:27,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:27,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 05:12:27,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:12:27,934 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:12:27,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:27,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1159967575, now seen corresponding path program 1 times [2024-11-28 05:12:27,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:27,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809114832] [2024-11-28 05:12:27,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:27,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:28,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:28,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809114832] [2024-11-28 05:12:28,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809114832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:28,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:28,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 05:12:28,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041572772] [2024-11-28 05:12:28,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:28,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 05:12:28,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:28,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 05:12:28,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-28 05:12:28,577 INFO L87 Difference]: Start difference. First operand 618 states and 713 transitions. Second operand has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:12:30,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:12:30,238 INFO L93 Difference]: Finished difference Result 637 states and 735 transitions. [2024-11-28 05:12:30,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 05:12:30,239 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-28 05:12:30,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:12:30,240 INFO L225 Difference]: With dead ends: 637 [2024-11-28 05:12:30,240 INFO L226 Difference]: Without dead ends: 637 [2024-11-28 05:12:30,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2024-11-28 05:12:30,241 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 513 mSDsluCounter, 2938 mSDsCounter, 0 mSdLazyCounter, 2603 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 3296 SdHoareTripleChecker+Invalid, 2627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:12:30,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 3296 Invalid, 2627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2603 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-28 05:12:30,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-28 05:12:30,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 633. [2024-11-28 05:12:30,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 454 states have (on average 1.5484581497797356) internal successors, (703), 625 states have internal predecessors, (703), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:12:30,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 730 transitions. [2024-11-28 05:12:30,251 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 730 transitions. Word has length 95 [2024-11-28 05:12:30,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:12:30,252 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 730 transitions. [2024-11-28 05:12:30,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:12:30,252 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 730 transitions. [2024-11-28 05:12:30,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-28 05:12:30,253 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:12:30,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:30,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 05:12:30,254 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:12:30,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:30,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1159967576, now seen corresponding path program 1 times [2024-11-28 05:12:30,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:30,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145002633] [2024-11-28 05:12:30,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:30,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:31,161 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-28 05:12:31,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:31,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145002633] [2024-11-28 05:12:31,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145002633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:31,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:31,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 05:12:31,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414547411] [2024-11-28 05:12:31,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:31,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 05:12:31,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:31,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 05:12:31,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-28 05:12:31,163 INFO L87 Difference]: Start difference. First operand 633 states and 730 transitions. Second operand has 13 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:12:32,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:12:32,689 INFO L93 Difference]: Finished difference Result 636 states and 734 transitions. [2024-11-28 05:12:32,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 05:12:32,690 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-28 05:12:32,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:12:32,692 INFO L225 Difference]: With dead ends: 636 [2024-11-28 05:12:32,693 INFO L226 Difference]: Without dead ends: 636 [2024-11-28 05:12:32,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-28 05:12:32,693 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 506 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:12:32,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1809 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 05:12:32,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-28 05:12:32,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 633. [2024-11-28 05:12:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 454 states have (on average 1.5462555066079295) internal successors, (702), 625 states have internal predecessors, (702), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:12:32,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 729 transitions. [2024-11-28 05:12:32,703 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 729 transitions. Word has length 95 [2024-11-28 05:12:32,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:12:32,703 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 729 transitions. [2024-11-28 05:12:32,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:12:32,703 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 729 transitions. [2024-11-28 05:12:32,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 05:12:32,705 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:12:32,705 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:32,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 05:12:32,705 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:12:32,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:32,706 INFO L85 PathProgramCache]: Analyzing trace with hash 694999540, now seen corresponding path program 1 times [2024-11-28 05:12:32,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:32,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884494783] [2024-11-28 05:12:32,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:32,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:33,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:33,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884494783] [2024-11-28 05:12:33,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884494783] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:12:33,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181043404] [2024-11-28 05:12:33,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:33,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:12:33,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:12:33,414 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:12:33,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 05:12:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:33,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-28 05:12:33,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:12:33,726 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-28 05:12:33,853 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:12:33,853 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 11 treesize of output 11 [2024-11-28 05:12:33,861 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-28 05:12:33,982 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:33,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 05:12:34,051 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:34,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 05:12:34,102 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:34,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 05:12:34,151 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:34,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 05:12:34,170 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-28 05:12:34,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:34,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:12:34,256 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1760))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1761)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 05:12:34,265 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1761)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 05:12:34,279 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1759))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1761)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 05:12:34,290 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1761)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 05:12:34,345 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-28 05:12:34,346 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 105 treesize of output 104 [2024-11-28 05:12:34,360 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1764))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1761)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-28 05:12:34,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181043404] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:12:34,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:12:34,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 20 [2024-11-28 05:12:34,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151590940] [2024-11-28 05:12:34,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:12:34,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 05:12:34,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:34,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 05:12:34,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=424, Unknown=15, NotChecked=230, Total=756 [2024-11-28 05:12:34,364 INFO L87 Difference]: Start difference. First operand 633 states and 729 transitions. Second operand has 21 states, 19 states have (on average 7.631578947368421) internal successors, (145), 21 states have internal predecessors, (145), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 05:12:36,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:12:36,456 INFO L93 Difference]: Finished difference Result 635 states and 733 transitions. [2024-11-28 05:12:36,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 05:12:36,456 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.631578947368421) internal successors, (145), 21 states have internal predecessors, (145), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2024-11-28 05:12:36,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:12:36,459 INFO L225 Difference]: With dead ends: 635 [2024-11-28 05:12:36,459 INFO L226 Difference]: Without dead ends: 635 [2024-11-28 05:12:36,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=833, Unknown=15, NotChecked=320, Total=1332 [2024-11-28 05:12:36,460 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 498 mSDsluCounter, 3232 mSDsCounter, 0 mSdLazyCounter, 2869 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 3590 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:12:36,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 3590 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2869 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-28 05:12:36,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-28 05:12:36,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 632. [2024-11-28 05:12:36,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 454 states have (on average 1.5440528634361232) internal successors, (701), 624 states have internal predecessors, (701), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:12:36,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 728 transitions. [2024-11-28 05:12:36,467 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 728 transitions. Word has length 96 [2024-11-28 05:12:36,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:12:36,467 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 728 transitions. [2024-11-28 05:12:36,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.631578947368421) internal successors, (145), 21 states have internal predecessors, (145), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 05:12:36,468 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 728 transitions. [2024-11-28 05:12:36,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 05:12:36,468 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:12:36,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:36,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 05:12:36,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-28 05:12:36,669 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:12:36,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:36,670 INFO L85 PathProgramCache]: Analyzing trace with hash 694999541, now seen corresponding path program 1 times [2024-11-28 05:12:36,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:36,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843561154] [2024-11-28 05:12:36,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:36,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:37,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:37,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:37,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843561154] [2024-11-28 05:12:37,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843561154] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:12:37,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123330344] [2024-11-28 05:12:37,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:37,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:12:37,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:12:37,828 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:12:37,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 05:12:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:38,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-28 05:12:38,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:12:38,319 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-28 05:12:38,489 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:12:38,489 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 11 treesize of output 11 [2024-11-28 05:12:38,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-28 05:12:38,510 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-28 05:12:38,516 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-28 05:12:38,581 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 22 treesize of output 10 [2024-11-28 05:12:38,587 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-28 05:12:38,732 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:38,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:12:38,739 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 30 treesize of output 13 [2024-11-28 05:12:38,846 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:38,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:12:38,856 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 30 treesize of output 13 [2024-11-28 05:12:38,939 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:38,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:12:38,948 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 30 treesize of output 13 [2024-11-28 05:12:39,037 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:39,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:12:39,048 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 30 treesize of output 13 [2024-11-28 05:12:39,067 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-28 05:12:39,076 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-28 05:12:39,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:39,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:12:39,155 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 05:12:39,166 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1929 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2024-11-28 05:12:39,188 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1927))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1928) .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1928) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1927) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-28 05:12:39,338 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1926))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1925) .cse0 v_ArrVal_1928) (select (select (store .cse1 .cse0 v_ArrVal_1927) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1929))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1926))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1927))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1925) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-28 05:12:39,413 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1927))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1925) .cse1 v_ArrVal_1928) .cse2 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1925) .cse6 v_ArrVal_1928) (select (select (store .cse7 .cse6 v_ArrVal_1927) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1929))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2024-11-28 05:12:39,503 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1936 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1936))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_1926))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1927))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1935) .cse0 v_ArrVal_1925) .cse1 v_ArrVal_1928) .cse2 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1936 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1936))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_1926))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1935) .cse7 v_ArrVal_1925) .cse8 v_ArrVal_1928) (select (select (store .cse9 .cse8 v_ArrVal_1927) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1929))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2024-11-28 05:12:39,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123330344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:12:39,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:12:39,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2024-11-28 05:12:39,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765755943] [2024-11-28 05:12:39,507 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:12:39,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 05:12:39,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:39,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 05:12:39,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=421, Unknown=13, NotChecked=282, Total=812 [2024-11-28 05:12:39,509 INFO L87 Difference]: Start difference. First operand 632 states and 728 transitions. Second operand has 20 states, 18 states have (on average 8.0) internal successors, (144), 20 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 05:12:42,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:12:42,311 INFO L93 Difference]: Finished difference Result 634 states and 732 transitions. [2024-11-28 05:12:42,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 05:12:42,312 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 8.0) internal successors, (144), 20 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2024-11-28 05:12:42,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:12:42,313 INFO L225 Difference]: With dead ends: 634 [2024-11-28 05:12:42,314 INFO L226 Difference]: Without dead ends: 634 [2024-11-28 05:12:42,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=156, Invalid=725, Unknown=13, NotChecked=366, Total=1260 [2024-11-28 05:12:42,315 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 490 mSDsluCounter, 2839 mSDsCounter, 0 mSdLazyCounter, 3234 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 3199 SdHoareTripleChecker+Invalid, 3258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:12:42,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 3199 Invalid, 3258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3234 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-28 05:12:42,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-28 05:12:42,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 616. [2024-11-28 05:12:42,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 440 states have (on average 1.5568181818181819) internal successors, (685), 609 states have internal predecessors, (685), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:12:42,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 711 transitions. [2024-11-28 05:12:42,324 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 711 transitions. Word has length 96 [2024-11-28 05:12:42,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:12:42,325 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 711 transitions. [2024-11-28 05:12:42,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 8.0) internal successors, (144), 20 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 05:12:42,325 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 711 transitions. [2024-11-28 05:12:42,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 05:12:42,326 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:12:42,326 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:42,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 05:12:42,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-28 05:12:42,527 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:12:42,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:42,527 INFO L85 PathProgramCache]: Analyzing trace with hash -603493543, now seen corresponding path program 1 times [2024-11-28 05:12:42,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:42,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189269164] [2024-11-28 05:12:42,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:42,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:43,436 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-28 05:12:43,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:43,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189269164] [2024-11-28 05:12:43,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189269164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:43,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:43,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-28 05:12:43,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831057631] [2024-11-28 05:12:43,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:43,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 05:12:43,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:43,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 05:12:43,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-28 05:12:43,438 INFO L87 Difference]: Start difference. First operand 616 states and 711 transitions. Second operand has 17 states, 15 states have (on average 6.466666666666667) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:12:45,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:12:45,067 INFO L93 Difference]: Finished difference Result 639 states and 737 transitions. [2024-11-28 05:12:45,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 05:12:45,068 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.466666666666667) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-28 05:12:45,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:12:45,070 INFO L225 Difference]: With dead ends: 639 [2024-11-28 05:12:45,071 INFO L226 Difference]: Without dead ends: 639 [2024-11-28 05:12:45,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2024-11-28 05:12:45,072 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 515 mSDsluCounter, 2624 mSDsCounter, 0 mSdLazyCounter, 2351 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 2981 SdHoareTripleChecker+Invalid, 2378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:12:45,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 2981 Invalid, 2378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2351 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 05:12:45,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-28 05:12:45,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 635. [2024-11-28 05:12:45,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 458 states have (on average 1.539301310043668) internal successors, (705), 627 states have internal predecessors, (705), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:12:45,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 732 transitions. [2024-11-28 05:12:45,093 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 732 transitions. Word has length 99 [2024-11-28 05:12:45,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:12:45,094 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 732 transitions. [2024-11-28 05:12:45,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.466666666666667) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:12:45,094 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 732 transitions. [2024-11-28 05:12:45,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 05:12:45,096 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:12:45,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:45,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 05:12:45,097 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:12:45,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:45,098 INFO L85 PathProgramCache]: Analyzing trace with hash -603493542, now seen corresponding path program 1 times [2024-11-28 05:12:45,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:45,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774223104] [2024-11-28 05:12:45,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:45,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:46,335 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-28 05:12:46,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:46,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774223104] [2024-11-28 05:12:46,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774223104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:46,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:46,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 05:12:46,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041201035] [2024-11-28 05:12:46,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:46,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 05:12:46,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:46,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 05:12:46,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-28 05:12:46,337 INFO L87 Difference]: Start difference. First operand 635 states and 732 transitions. Second operand has 18 states, 16 states have (on average 6.0625) internal successors, (97), 17 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:12:49,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:12:49,495 INFO L93 Difference]: Finished difference Result 638 states and 736 transitions. [2024-11-28 05:12:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 05:12:49,496 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.0625) internal successors, (97), 17 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-28 05:12:49,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:12:49,498 INFO L225 Difference]: With dead ends: 638 [2024-11-28 05:12:49,498 INFO L226 Difference]: Without dead ends: 638 [2024-11-28 05:12:49,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-28 05:12:49,499 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 506 mSDsluCounter, 3386 mSDsCounter, 0 mSdLazyCounter, 3898 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 3743 SdHoareTripleChecker+Invalid, 3924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:12:49,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 3743 Invalid, 3924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3898 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-28 05:12:49,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-28 05:12:49,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 635. [2024-11-28 05:12:49,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 458 states have (on average 1.537117903930131) internal successors, (704), 627 states have internal predecessors, (704), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:12:49,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 731 transitions. [2024-11-28 05:12:49,508 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 731 transitions. Word has length 99 [2024-11-28 05:12:49,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:12:49,508 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 731 transitions. [2024-11-28 05:12:49,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.0625) internal successors, (97), 17 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:12:49,508 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 731 transitions. [2024-11-28 05:12:49,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 05:12:49,509 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:12:49,509 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:49,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 05:12:49,509 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:12:49,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:49,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1812857994, now seen corresponding path program 1 times [2024-11-28 05:12:49,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:49,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250963546] [2024-11-28 05:12:49,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:49,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:50,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:50,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:50,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250963546] [2024-11-28 05:12:50,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250963546] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:12:50,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253524480] [2024-11-28 05:12:50,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:50,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:12:50,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:12:50,787 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:12:50,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 05:12:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:51,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 05:12:51,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:12:51,142 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-28 05:12:51,284 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:12:51,284 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 11 treesize of output 11 [2024-11-28 05:12:51,295 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-28 05:12:51,417 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:51,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 05:12:51,504 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:51,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 05:12:51,563 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:51,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 05:12:51,623 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:51,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 05:12:51,689 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:51,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 05:12:51,704 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-28 05:12:51,732 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 05:12:51,732 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 16 [2024-11-28 05:12:51,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:51,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:12:52,673 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-28 05:12:52,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 794 [2024-11-28 05:12:52,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253524480] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:12:52,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:12:52,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 22 [2024-11-28 05:12:52,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614053550] [2024-11-28 05:12:52,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:12:52,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-28 05:12:52,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:52,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-28 05:12:52,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=920, Unknown=57, NotChecked=0, Total=1122 [2024-11-28 05:12:52,844 INFO L87 Difference]: Start difference. First operand 635 states and 731 transitions. Second operand has 23 states, 21 states have (on average 7.190476190476191) internal successors, (151), 23 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 05:12:55,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:12:55,026 INFO L93 Difference]: Finished difference Result 637 states and 735 transitions. [2024-11-28 05:12:55,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 05:12:55,027 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 7.190476190476191) internal successors, (151), 23 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2024-11-28 05:12:55,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:12:55,028 INFO L225 Difference]: With dead ends: 637 [2024-11-28 05:12:55,028 INFO L226 Difference]: Without dead ends: 637 [2024-11-28 05:12:55,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=267, Invalid=1568, Unknown=57, NotChecked=0, Total=1892 [2024-11-28 05:12:55,030 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 491 mSDsluCounter, 3560 mSDsCounter, 0 mSdLazyCounter, 3111 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 3917 SdHoareTripleChecker+Invalid, 3135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:12:55,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 3917 Invalid, 3135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3111 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 05:12:55,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-28 05:12:55,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 634. [2024-11-28 05:12:55,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 458 states have (on average 1.534934497816594) internal successors, (703), 626 states have internal predecessors, (703), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:12:55,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 730 transitions. [2024-11-28 05:12:55,052 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 730 transitions. Word has length 100 [2024-11-28 05:12:55,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:12:55,056 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 730 transitions. [2024-11-28 05:12:55,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 7.190476190476191) internal successors, (151), 23 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 05:12:55,057 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 730 transitions. [2024-11-28 05:12:55,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 05:12:55,061 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:12:55,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:55,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 05:12:55,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-28 05:12:55,262 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:12:55,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:55,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1812857993, now seen corresponding path program 1 times [2024-11-28 05:12:55,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:55,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699978790] [2024-11-28 05:12:55,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:55,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:56,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:56,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699978790] [2024-11-28 05:12:56,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699978790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:12:56,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979919150] [2024-11-28 05:12:56,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:56,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:12:56,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:12:56,586 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:12:56,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 05:12:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:56,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-28 05:12:56,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:12:56,926 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-28 05:12:57,083 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:12:57,083 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 11 treesize of output 11 [2024-11-28 05:12:57,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-28 05:12:57,124 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-28 05:12:57,131 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-28 05:12:57,237 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 22 treesize of output 10 [2024-11-28 05:12:57,242 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-28 05:12:57,421 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:57,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 05:12:57,432 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 30 treesize of output 13 [2024-11-28 05:12:57,587 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:57,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 05:12:57,608 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 30 treesize of output 13 [2024-11-28 05:12:57,737 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:57,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 05:12:57,742 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 30 treesize of output 13 [2024-11-28 05:12:57,894 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:57,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 05:12:57,902 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 30 treesize of output 13 [2024-11-28 05:12:58,060 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:12:58,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 05:12:58,067 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 30 treesize of output 13 [2024-11-28 05:12:58,112 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 42 treesize of output 18 [2024-11-28 05:12:58,123 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-28 05:12:58,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:12:58,213 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-28 05:12:58,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-28 05:12:58,226 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:12:58,226 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 11 treesize of output 11 [2024-11-28 05:12:58,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:58,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:12:58,781 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))) (forall ((v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (v_ArrVal_2453 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2454) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1)))) (forall ((v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2453 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)) (forall ((v_ArrVal_2457 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2453))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2454) .cse1 v_ArrVal_2456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2457) (select (select (store .cse2 .cse1 v_ArrVal_2455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))) is different from false [2024-11-28 05:12:59,414 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2452 (Array Int Int)) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2450))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2451))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2449) .cse0 v_ArrVal_2452) .cse1 v_ArrVal_2454) (select (select (store .cse2 .cse1 v_ArrVal_2453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2456))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))) (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2452 (Array Int Int)) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)) (forall ((v_ArrVal_2457 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2450))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2451))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2453))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2449) .cse5 v_ArrVal_2452) .cse6 v_ArrVal_2454) .cse7 v_ArrVal_2456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2457) (select (select (store .cse8 .cse7 v_ArrVal_2455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-28 05:13:13,796 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:13:13,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 604 treesize of output 622 [2024-11-28 05:13:14,320 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2463 (Array Int Int)) (v_ArrVal_2452 (Array Int Int)) (v_ArrVal_2462 (Array Int Int)) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2462))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2450))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2451))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2463) .cse0 v_ArrVal_2449) .cse1 v_ArrVal_2452) .cse2 v_ArrVal_2454) (select (select (store .cse3 .cse2 v_ArrVal_2453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2456))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((v_prenex_24 Int)) (or (forall ((v_prenex_21 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_2457 Int) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_28))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_prenex_30))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_prenex_29))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_prenex_25))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_26) .cse7 v_prenex_21) .cse8 v_prenex_27) .cse9 v_prenex_23) .cse10 v_prenex_22) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 3) (select (store |c_#length| v_prenex_24 v_ArrVal_2457) (select (select (store .cse11 .cse10 v_ArrVal_2455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_24))))) is different from false [2024-11-28 05:13:14,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979919150] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:13:14,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:13:14,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2024-11-28 05:13:14,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303274376] [2024-11-28 05:13:14,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:13:14,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-28 05:13:14,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:13:14,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-28 05:13:14,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1425, Unknown=34, NotChecked=240, Total=1892 [2024-11-28 05:13:14,331 INFO L87 Difference]: Start difference. First operand 634 states and 730 transitions. Second operand has 32 states, 29 states have (on average 5.586206896551724) internal successors, (162), 30 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:13:35,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:13:35,919 INFO L93 Difference]: Finished difference Result 636 states and 734 transitions. [2024-11-28 05:13:35,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 05:13:35,920 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 5.586206896551724) internal successors, (162), 30 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 100 [2024-11-28 05:13:35,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:13:35,922 INFO L225 Difference]: With dead ends: 636 [2024-11-28 05:13:35,922 INFO L226 Difference]: Without dead ends: 636 [2024-11-28 05:13:35,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=334, Invalid=2194, Unknown=34, NotChecked=300, Total=2862 [2024-11-28 05:13:35,924 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 496 mSDsluCounter, 3980 mSDsCounter, 0 mSdLazyCounter, 5039 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 4336 SdHoareTripleChecker+Invalid, 5071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 5039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:13:35,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 4336 Invalid, 5071 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 5039 Invalid, 0 Unknown, 0 Unchecked, 19.9s Time] [2024-11-28 05:13:35,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-28 05:13:35,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 614. [2024-11-28 05:13:35,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 440 states have (on average 1.5522727272727272) internal successors, (683), 607 states have internal predecessors, (683), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:13:35,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 709 transitions. [2024-11-28 05:13:35,933 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 709 transitions. Word has length 100 [2024-11-28 05:13:35,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:13:35,933 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 709 transitions. [2024-11-28 05:13:35,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 5.586206896551724) internal successors, (162), 30 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:13:35,933 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 709 transitions. [2024-11-28 05:13:35,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-28 05:13:35,934 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:13:35,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:13:35,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-28 05:13:36,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-28 05:13:36,135 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:13:36,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:36,135 INFO L85 PathProgramCache]: Analyzing trace with hash 57602063, now seen corresponding path program 1 times [2024-11-28 05:13:36,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:13:36,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743984545] [2024-11-28 05:13:36,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:36,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:13:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:13:37,558 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-28 05:13:37,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:13:37,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743984545] [2024-11-28 05:13:37,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743984545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:13:37,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:13:37,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 05:13:37,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883582681] [2024-11-28 05:13:37,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:13:37,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 05:13:37,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:13:37,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 05:13:37,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-28 05:13:37,560 INFO L87 Difference]: Start difference. First operand 614 states and 709 transitions. Second operand has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:13:48,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:13:48,523 INFO L93 Difference]: Finished difference Result 640 states and 738 transitions. [2024-11-28 05:13:48,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 05:13:48,523 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-28 05:13:48,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:13:48,525 INFO L225 Difference]: With dead ends: 640 [2024-11-28 05:13:48,526 INFO L226 Difference]: Without dead ends: 640 [2024-11-28 05:13:48,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2024-11-28 05:13:48,526 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 510 mSDsluCounter, 3268 mSDsCounter, 0 mSdLazyCounter, 2809 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 3627 SdHoareTripleChecker+Invalid, 2832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:13:48,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 3627 Invalid, 2832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2809 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2024-11-28 05:13:48,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-11-28 05:13:48,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 636. [2024-11-28 05:13:48,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 461 states have (on average 1.5314533622559654) internal successors, (706), 628 states have internal predecessors, (706), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:13:48,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 733 transitions. [2024-11-28 05:13:48,533 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 733 transitions. Word has length 102 [2024-11-28 05:13:48,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:13:48,533 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 733 transitions. [2024-11-28 05:13:48,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:13:48,533 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 733 transitions. [2024-11-28 05:13:48,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-28 05:13:48,534 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:13:48,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:13:48,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-28 05:13:48,534 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:13:48,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:48,535 INFO L85 PathProgramCache]: Analyzing trace with hash 57602064, now seen corresponding path program 1 times [2024-11-28 05:13:48,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:13:48,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231981957] [2024-11-28 05:13:48,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:48,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:13:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:13:51,239 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-28 05:13:51,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:13:51,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231981957] [2024-11-28 05:13:51,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231981957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:13:51,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:13:51,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 05:13:51,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54299726] [2024-11-28 05:13:51,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:13:51,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 05:13:51,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:13:51,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 05:13:51,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-28 05:13:51,241 INFO L87 Difference]: Start difference. First operand 636 states and 733 transitions. Second operand has 19 states, 17 states have (on average 5.882352941176471) internal successors, (100), 18 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:14:02,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:14:02,687 INFO L93 Difference]: Finished difference Result 639 states and 737 transitions. [2024-11-28 05:14:02,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 05:14:02,688 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.882352941176471) internal successors, (100), 18 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-28 05:14:02,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:14:02,690 INFO L225 Difference]: With dead ends: 639 [2024-11-28 05:14:02,690 INFO L226 Difference]: Without dead ends: 639 [2024-11-28 05:14:02,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-11-28 05:14:02,691 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 506 mSDsluCounter, 2248 mSDsCounter, 0 mSdLazyCounter, 2743 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 2769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:14:02,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 2605 Invalid, 2769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2743 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2024-11-28 05:14:02,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-28 05:14:02,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 636. [2024-11-28 05:14:02,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 461 states have (on average 1.529284164859002) internal successors, (705), 628 states have internal predecessors, (705), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:14:02,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 732 transitions. [2024-11-28 05:14:02,701 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 732 transitions. Word has length 102 [2024-11-28 05:14:02,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:14:02,702 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 732 transitions. [2024-11-28 05:14:02,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.882352941176471) internal successors, (100), 18 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:14:02,702 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 732 transitions. [2024-11-28 05:14:02,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 05:14:02,703 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:14:02,703 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:02,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-28 05:14:02,703 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:14:02,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:02,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1933078830, now seen corresponding path program 1 times [2024-11-28 05:14:02,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:02,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210170050] [2024-11-28 05:14:02,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:02,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:03,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 05:14:03,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:03,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210170050] [2024-11-28 05:14:03,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210170050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:03,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:03,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:14:03,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978101418] [2024-11-28 05:14:03,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:03,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:14:03,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:03,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:14:03,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:14:03,264 INFO L87 Difference]: Start difference. First operand 636 states and 732 transitions. Second operand has 6 states, 5 states have (on average 20.2) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:14:06,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:14:06,516 INFO L93 Difference]: Finished difference Result 635 states and 731 transitions. [2024-11-28 05:14:06,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:14:06,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.2) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2024-11-28 05:14:06,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:14:06,518 INFO L225 Difference]: With dead ends: 635 [2024-11-28 05:14:06,518 INFO L226 Difference]: Without dead ends: 635 [2024-11-28 05:14:06,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:14:06,519 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 2 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2103 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:14:06,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2103 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-28 05:14:06,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-28 05:14:06,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2024-11-28 05:14:06,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 461 states have (on average 1.527114967462039) internal successors, (704), 627 states have internal predecessors, (704), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:14:06,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 731 transitions. [2024-11-28 05:14:06,530 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 731 transitions. Word has length 103 [2024-11-28 05:14:06,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:14:06,530 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 731 transitions. [2024-11-28 05:14:06,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.2) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:14:06,531 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 731 transitions. [2024-11-28 05:14:06,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 05:14:06,532 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:14:06,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:06,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-28 05:14:06,532 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:14:06,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:06,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1933078829, now seen corresponding path program 1 times [2024-11-28 05:14:06,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:06,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089874570] [2024-11-28 05:14:06,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:06,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:09,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:14:09,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:09,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089874570] [2024-11-28 05:14:09,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089874570] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:14:09,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994554624] [2024-11-28 05:14:09,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:09,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:14:09,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:14:09,398 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:14:09,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 05:14:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:09,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-28 05:14:09,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:14:09,728 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-28 05:14:10,283 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:14:10,283 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 11 treesize of output 11 [2024-11-28 05:14:10,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-28 05:14:10,435 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-28 05:14:10,460 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-28 05:14:10,843 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 22 treesize of output 10 [2024-11-28 05:14:10,855 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-28 05:14:11,477 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:14:11,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 05:14:11,490 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 30 treesize of output 13 [2024-11-28 05:14:11,991 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:14:11,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 05:14:12,002 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 30 treesize of output 13 [2024-11-28 05:14:12,370 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:14:12,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 05:14:12,381 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 30 treesize of output 13 [2024-11-28 05:14:12,776 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:14:12,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 05:14:12,811 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 30 treesize of output 13 [2024-11-28 05:14:13,267 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:14:13,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 05:14:13,278 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 30 treesize of output 13 [2024-11-28 05:14:13,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:14:13,709 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-28 05:14:13,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2024-11-28 05:14:13,757 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-28 05:14:13,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-28 05:14:14,006 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:14:14,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:14:14,016 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 30 treesize of output 13 [2024-11-28 05:14:14,109 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-28 05:14:14,120 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-28 05:14:14,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:14:14,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:14:14,442 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2920 (Array Int Int)) (v_ArrVal_2919 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 44) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2920) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2919 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 05:14:15,138 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2919 (Array Int Int)) (v_ArrVal_2917 (Array Int Int)) (v_ArrVal_2916 (Array Int Int))) (<= 0 (+ 40 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2917) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2917 (Array Int Int)) (v_ArrVal_2916 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)) (forall ((v_ArrVal_2920 (Array Int Int)) (v_ArrVal_2918 Int) (v_ArrVal_2919 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2916))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 44 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2917) .cse1 v_ArrVal_2919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2918) (select (select (store .cse2 .cse1 v_ArrVal_2920) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))) is different from false [2024-11-28 05:14:15,997 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0))) (forall ((v_ArrVal_2919 (Array Int Int)) (v_ArrVal_2917 (Array Int Int)) (v_ArrVal_2916 (Array Int Int)) (v_ArrVal_2915 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2914))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2915) .cse1 v_ArrVal_2917) (select (select (store .cse2 .cse1 v_ArrVal_2916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2919))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2917 (Array Int Int)) (v_ArrVal_2916 (Array Int Int)) (v_ArrVal_2915 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)) (forall ((v_ArrVal_2920 (Array Int Int)) (v_ArrVal_2918 Int) (v_ArrVal_2919 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2914))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2916))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 44 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2915) .cse4 v_ArrVal_2917) .cse5 v_ArrVal_2919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2918) (select (select (store .cse6 .cse5 v_ArrVal_2920) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))))) is different from false [2024-11-28 05:14:54,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:14:54,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1180 treesize of output 1198 [2024-11-28 05:14:59,234 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_prenex_38 (Array Int Int)) (v_prenex_37 (Array Int Int))) (< 0 (+ 41 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_41))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_prenex_34))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_prenex_32))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_prenex_42))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_39) .cse0 v_prenex_33) .cse1 v_prenex_31) .cse2 v_prenex_40) .cse3 v_prenex_37) (select (select (store .cse4 .cse3 v_prenex_38) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_36))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc57#1.base_9| |c_ULTIMATE.start_main_#t~mem50#1.base|) (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int)) (v_ArrVal_2910 (Array Int Int)) (v_ArrVal_2920 (Array Int Int)) (v_ArrVal_2918 Int) (v_ArrVal_2919 (Array Int Int)) (v_ArrVal_2917 (Array Int Int)) (v_ArrVal_2916 (Array Int Int)) (v_ArrVal_2926 (Array Int Int)) (v_ArrVal_2915 (Array Int Int)) (v_ArrVal_2925 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2925))) (let ((.cse9 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse9 v_ArrVal_2910))) (let ((.cse10 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse10 v_ArrVal_2912))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_2914))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_2916))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< (+ (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2926) .cse9 v_ArrVal_2911) .cse10 v_ArrVal_2913) .cse11 v_ArrVal_2915) .cse12 v_ArrVal_2917) .cse13 v_ArrVal_2919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2918) (select (select (store .cse14 .cse13 v_ArrVal_2920) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))))))) is different from false [2024-11-28 05:14:59,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994554624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:14:59,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:14:59,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 32 [2024-11-28 05:14:59,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420242435] [2024-11-28 05:14:59,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:14:59,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-28 05:14:59,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:59,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-28 05:14:59,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1530, Unknown=47, NotChecked=340, Total=2162 [2024-11-28 05:14:59,292 INFO L87 Difference]: Start difference. First operand 635 states and 731 transitions. Second operand has 33 states, 30 states have (on average 5.566666666666666) internal successors, (167), 31 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:15:42,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:15:42,060 INFO L93 Difference]: Finished difference Result 637 states and 735 transitions. [2024-11-28 05:15:42,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 05:15:42,061 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 5.566666666666666) internal successors, (167), 31 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2024-11-28 05:15:42,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:15:42,063 INFO L225 Difference]: With dead ends: 637 [2024-11-28 05:15:42,063 INFO L226 Difference]: Without dead ends: 637 [2024-11-28 05:15:42,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 50.5s TimeCoverageRelationStatistics Valid=407, Invalid=2424, Unknown=47, NotChecked=428, Total=3306 [2024-11-28 05:15:42,064 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 489 mSDsluCounter, 3271 mSDsCounter, 0 mSdLazyCounter, 4030 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 3626 SdHoareTripleChecker+Invalid, 4062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 4030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:15:42,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 3626 Invalid, 4062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 4030 Invalid, 0 Unknown, 0 Unchecked, 38.7s Time] [2024-11-28 05:15:42,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-28 05:15:42,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 612. [2024-11-28 05:15:42,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 440 states have (on average 1.5477272727272726) internal successors, (681), 605 states have internal predecessors, (681), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:15:42,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 707 transitions. [2024-11-28 05:15:42,073 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 707 transitions. Word has length 103 [2024-11-28 05:15:42,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:15:42,073 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 707 transitions. [2024-11-28 05:15:42,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 5.566666666666666) internal successors, (167), 31 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:15:42,073 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 707 transitions. [2024-11-28 05:15:42,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-28 05:15:42,074 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:15:42,074 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:15:42,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 05:15:42,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-28 05:15:42,278 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:15:42,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:15:42,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1963212095, now seen corresponding path program 1 times [2024-11-28 05:15:42,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:15:42,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884415990] [2024-11-28 05:15:42,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:42,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:15:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:46,099 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-28 05:15:46,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:15:46,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884415990] [2024-11-28 05:15:46,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884415990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:15:46,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:15:46,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 05:15:46,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908751503] [2024-11-28 05:15:46,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:15:46,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 05:15:46,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:15:46,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 05:15:46,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-28 05:15:46,102 INFO L87 Difference]: Start difference. First operand 612 states and 707 transitions. Second operand has 16 states, 15 states have (on average 6.866666666666666) internal successors, (103), 16 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:16:08,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:16:08,407 INFO L93 Difference]: Finished difference Result 663 states and 763 transitions. [2024-11-28 05:16:08,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 05:16:08,408 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.866666666666666) internal successors, (103), 16 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2024-11-28 05:16:08,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:16:08,410 INFO L225 Difference]: With dead ends: 663 [2024-11-28 05:16:08,410 INFO L226 Difference]: Without dead ends: 663 [2024-11-28 05:16:08,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2024-11-28 05:16:08,411 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 578 mSDsluCounter, 1924 mSDsCounter, 0 mSdLazyCounter, 2151 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 2285 SdHoareTripleChecker+Invalid, 2177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:16:08,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 2285 Invalid, 2177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2151 Invalid, 0 Unknown, 0 Unchecked, 20.3s Time] [2024-11-28 05:16:08,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2024-11-28 05:16:08,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 637. [2024-11-28 05:16:08,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 464 states have (on average 1.5237068965517242) internal successors, (707), 629 states have internal predecessors, (707), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:16:08,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 734 transitions. [2024-11-28 05:16:08,420 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 734 transitions. Word has length 105 [2024-11-28 05:16:08,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:16:08,421 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 734 transitions. [2024-11-28 05:16:08,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.866666666666666) internal successors, (103), 16 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:16:08,421 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 734 transitions. [2024-11-28 05:16:08,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-28 05:16:08,421 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:16:08,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:16:08,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-28 05:16:08,422 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:16:08,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:16:08,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1963212096, now seen corresponding path program 1 times [2024-11-28 05:16:08,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:16:08,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400217267] [2024-11-28 05:16:08,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:08,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:16:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:11,685 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-28 05:16:11,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:16:11,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400217267] [2024-11-28 05:16:11,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400217267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:16:11,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:16:11,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-28 05:16:11,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235082632] [2024-11-28 05:16:11,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:16:11,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 05:16:11,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:16:11,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 05:16:11,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-28 05:16:11,687 INFO L87 Difference]: Start difference. First operand 637 states and 734 transitions. Second operand has 17 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:16:45,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:16:45,118 INFO L93 Difference]: Finished difference Result 662 states and 762 transitions. [2024-11-28 05:16:45,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 05:16:45,118 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2024-11-28 05:16:45,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:16:45,121 INFO L225 Difference]: With dead ends: 662 [2024-11-28 05:16:45,122 INFO L226 Difference]: Without dead ends: 662 [2024-11-28 05:16:45,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2024-11-28 05:16:45,122 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 536 mSDsluCounter, 3992 mSDsCounter, 0 mSdLazyCounter, 3405 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 4358 SdHoareTripleChecker+Invalid, 3430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 3405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:16:45,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 4358 Invalid, 3430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 3405 Invalid, 0 Unknown, 0 Unchecked, 31.7s Time] [2024-11-28 05:16:45,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-28 05:16:45,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 637. [2024-11-28 05:16:45,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 464 states have (on average 1.521551724137931) internal successors, (706), 629 states have internal predecessors, (706), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:16:45,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 733 transitions. [2024-11-28 05:16:45,134 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 733 transitions. Word has length 105 [2024-11-28 05:16:45,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:16:45,134 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 733 transitions. [2024-11-28 05:16:45,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:16:45,135 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 733 transitions. [2024-11-28 05:16:45,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-28 05:16:45,136 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:16:45,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:16:45,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-28 05:16:45,136 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:16:45,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:16:45,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1429272290, now seen corresponding path program 1 times [2024-11-28 05:16:45,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:16:45,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859855809] [2024-11-28 05:16:45,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:45,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:16:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:49,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:16:49,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:16:49,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859855809] [2024-11-28 05:16:49,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859855809] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:16:49,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774009950] [2024-11-28 05:16:49,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:49,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:16:49,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:16:49,577 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:16:49,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 05:16:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:49,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-28 05:16:49,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:16:49,953 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-28 05:16:51,340 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:16:51,340 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 11 treesize of output 11 [2024-11-28 05:16:51,656 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-28 05:16:51,714 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 19 treesize of output 1 [2024-11-28 05:16:52,741 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:16:52,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 05:16:52,762 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 30 treesize of output 13 [2024-11-28 05:16:53,329 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:16:53,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 05:16:53,353 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 30 treesize of output 13 [2024-11-28 05:16:53,918 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:16:53,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 05:16:53,940 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 30 treesize of output 13 [2024-11-28 05:16:54,582 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:16:54,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 05:16:54,612 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 30 treesize of output 13 [2024-11-28 05:16:55,239 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:16:55,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 05:16:55,260 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 30 treesize of output 13 [2024-11-28 05:16:55,938 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:16:55,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 05:16:55,960 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 30 treesize of output 13 [2024-11-28 05:16:56,681 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:16:56,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2024-11-28 05:16:56,702 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 49 treesize of output 30 [2024-11-28 05:16:57,258 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 39 treesize of output 21 [2024-11-28 05:16:57,279 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 32 treesize of output 14 [2024-11-28 05:16:57,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:16:57,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:16:58,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:58,559 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 46 treesize of output 50 [2024-11-28 05:16:58,772 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3316 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem58#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_ArrVal_3317 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_prenex_43 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ 41 |c_ULTIMATE.start_main_#t~mem58#1.offset|))))) is different from false [2024-11-28 05:16:58,866 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3317 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_prenex_43 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ 41 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3316 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse0))))) is different from false [2024-11-28 05:16:59,016 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3317 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3315) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3316 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3314))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (= (select (select (store .cse1 .cse2 v_ArrVal_3316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) .cse2)))) (forall ((v_prenex_43 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3315))) (< (select (select (store .cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ 41 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))))) is different from false [2024-11-28 05:16:59,167 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_prenex_43 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_3315))) (< (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 41)))) (forall ((v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3316 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_3314))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse3 (select (select (store .cse4 .cse3 v_ArrVal_3316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3317 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_3315) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 05:16:59,349 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_43 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3312))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3313) .cse2 v_ArrVal_3315))) (< (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ 41 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) (forall ((v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3316 (Array Int Int))) (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3312))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3314)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse4 (select (select (store .cse5 .cse4 v_ArrVal_3316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (forall ((v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3317 (Array Int Int))) (<= 0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3312))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3313) .cse7 v_ArrVal_3315) (select (select (store .cse8 .cse7 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3317))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) is different from false [2024-11-28 05:16:59,661 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3317 (Array Int Int))) (<= 0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3312))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3313) .cse1 v_ArrVal_3315) (select (select (store .cse2 .cse1 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3317))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_prenex_43 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3312))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3313) .cse6 v_ArrVal_3315))) (< (select (select (store .cse4 (select (select (store .cse5 .cse6 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ 41 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) (forall ((v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3316 (Array Int Int))) (let ((.cse7 (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3312))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3314)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (store .cse7 .cse8 v_ArrVal_3316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse8))))))) is different from false [2024-11-28 05:17:00,112 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3316 (Array Int Int))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3311))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3312)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3314)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_3316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3317 (Array Int Int))) (<= 0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3311))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_3312))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3310) .cse5 v_ArrVal_3313) .cse6 v_ArrVal_3315) (select (select (store .cse7 .cse6 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3317))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (forall ((v_prenex_43 (Array Int Int)) (v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3311))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse10 (store .cse13 .cse12 v_ArrVal_3312))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse9 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3310) .cse12 v_ArrVal_3313) .cse11 v_ArrVal_3315))) (< (select (select (store .cse9 (select (select (store .cse10 .cse11 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ 41 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))))) is different from false [2024-11-28 05:17:04,447 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_prenex_43 (Array Int Int)) (v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3311))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store .cse6 .cse5 v_ArrVal_3312))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3310) .cse5 v_ArrVal_3313) .cse2 v_ArrVal_3315))) (< (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ 41 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))) (forall ((v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3316 (Array Int Int))) (let ((.cse7 (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3311))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3312)))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3314)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (store .cse7 .cse8 v_ArrVal_3316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse8)))) (forall ((v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3317 (Array Int Int))) (<= 0 (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3311))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_3312))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3310) .cse11 v_ArrVal_3313) .cse12 v_ArrVal_3315) (select (select (store .cse13 .cse12 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3317))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))) is different from false [2024-11-28 05:17:07,601 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3308 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (<= 0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3309))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3311))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3312))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3308) .cse0 v_ArrVal_3310) .cse1 v_ArrVal_3313) .cse2 v_ArrVal_3315) (select (select (store .cse3 .cse2 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3317))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (forall ((v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3316 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (let ((.cse7 (let ((.cse9 (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3309))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3311)))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3312)))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3314)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (= (select (select (store .cse7 .cse8 v_ArrVal_3316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) .cse8)))) (forall ((v_prenex_43 (Array Int Int)) (v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3308 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3309))) (let ((.cse15 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_3311))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse17 .cse16 v_ArrVal_3312))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3308) .cse15 v_ArrVal_3310) .cse16 v_ArrVal_3313) .cse14 v_ArrVal_3315))) (< (select (select (store .cse12 (select (select (store .cse13 .cse14 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (+ (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 41)))))))))))) is different from false [2024-11-28 05:17:10,400 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_prenex_43 (Array Int Int)) (v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3308 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3309))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_3311))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store .cse7 .cse6 v_ArrVal_3312))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3308) .cse5 v_ArrVal_3310) .cse6 v_ArrVal_3313) .cse2 v_ArrVal_3315))) (< (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ 41 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) (forall ((v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3308 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (<= 0 (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3309))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_3311))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3312))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3308) .cse9 v_ArrVal_3310) .cse10 v_ArrVal_3313) .cse11 v_ArrVal_3315) (select (select (store .cse12 .cse11 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3317))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3316 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (let ((.cse15 (let ((.cse17 (let ((.cse18 (let ((.cse19 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3309))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3311)))) (store .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3312)))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3314)))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (store .cse15 .cse16 v_ArrVal_3316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse16))))))) is different from false [2024-11-28 05:17:24,099 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3316 (Array Int Int)) (v_ArrVal_3307 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3307))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3309)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3311)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3312)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3314)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_3316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) (forall ((v_prenex_43 (Array Int Int)) (v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3306 (Array Int Int)) (v_ArrVal_3307 (Array Int Int)) (v_ArrVal_3308 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3307))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_3309))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_3311))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_3312))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse7 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3306) .cse10 v_ArrVal_3308) .cse11 v_ArrVal_3310) .cse12 v_ArrVal_3313) .cse9 v_ArrVal_3315))) (< (select (select (store .cse7 (select (select (store .cse8 .cse9 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ 41 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))))))) (forall ((v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3306 (Array Int Int)) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3307 (Array Int Int)) (v_ArrVal_3308 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (<= 0 (select (select (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3307))) (let ((.cse16 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse22 (store .cse23 .cse16 v_ArrVal_3309))) (let ((.cse17 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse21 (store .cse22 .cse17 v_ArrVal_3311))) (let ((.cse18 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse20 (store .cse21 .cse18 v_ArrVal_3312))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3306) .cse16 v_ArrVal_3308) .cse17 v_ArrVal_3310) .cse18 v_ArrVal_3313) .cse19 v_ArrVal_3315) (select (select (store .cse20 .cse19 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3317))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-28 05:17:27,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-28 05:17:27,967 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-28 05:17:27,968 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-28 05:17:27,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-28 05:17:28,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-28 05:17:28,171 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:842) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2024-11-28 05:17:28,178 INFO L158 Benchmark]: Toolchain (without parser) took 353898.65ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 116.1MB in the beginning and 457.6MB in the end (delta: -341.5MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. [2024-11-28 05:17:28,178 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 142.6MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:17:28,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 708.06ms. Allocated memory is still 142.6MB. Free memory was 116.1MB in the beginning and 88.6MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 05:17:28,179 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.49ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 83.1MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:17:28,179 INFO L158 Benchmark]: Boogie Preprocessor took 184.46ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 73.4MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:17:28,179 INFO L158 Benchmark]: RCFGBuilder took 2447.54ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 73.4MB in the beginning and 350.8MB in the end (delta: -277.4MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2024-11-28 05:17:28,179 INFO L158 Benchmark]: TraceAbstraction took 350474.47ms. Allocated memory was 427.8MB in the beginning and 570.4MB in the end (delta: 142.6MB). Free memory was 349.9MB in the beginning and 457.6MB in the end (delta: -107.7MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2024-11-28 05:17:28,181 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.43ms. Allocated memory is still 142.6MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 708.06ms. Allocated memory is still 142.6MB. Free memory was 116.1MB in the beginning and 88.6MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.49ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 83.1MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 184.46ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 73.4MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2447.54ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 73.4MB in the beginning and 350.8MB in the end (delta: -277.4MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. * TraceAbstraction took 350474.47ms. Allocated memory was 427.8MB in the beginning and 570.4MB in the end (delta: 142.6MB). Free memory was 349.9MB in the beginning and 457.6MB in the end (delta: -107.7MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8a34048511216dfe9a14f70dd929fd2de5a6eaf4560cb9e9e466dd0467a1d6d7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:17:30,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:17:30,824 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-28 05:17:30,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:17:30,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:17:30,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:17:30,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:17:30,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:17:30,873 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:17:30,873 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:17:30,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:17:30,874 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:17:30,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:17:30,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:17:30,874 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:17:30,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:17:30,875 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:17:30,875 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:17:30,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:17:30,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:17:30,875 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 05:17:30,876 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 05:17:30,876 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 05:17:30,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:17:30,876 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 05:17:30,876 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 05:17:30,876 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 05:17:30,876 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 05:17:30,877 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:17:30,877 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:17:30,877 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:17:30,877 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:17:30,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:17:30,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:17:30,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:17:30,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:17:30,878 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:17:30,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:17:30,878 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:17:30,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:17:30,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:17:30,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:17:30,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:17:30,879 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 05:17:30,879 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 05:17:30,879 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:17:30,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:17:30,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:17:30,879 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:17:30,879 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8a34048511216dfe9a14f70dd929fd2de5a6eaf4560cb9e9e466dd0467a1d6d7 [2024-11-28 05:17:31,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:17:31,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:17:31,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:17:31,245 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:17:31,246 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:17:31,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-1.i [2024-11-28 05:17:34,344 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/data/2995c6de7/ae6ad21298a043259038de248a1eb5dc/FLAG5e7230f12 [2024-11-28 05:17:34,753 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:17:34,754 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-1.i [2024-11-28 05:17:34,770 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/data/2995c6de7/ae6ad21298a043259038de248a1eb5dc/FLAG5e7230f12 [2024-11-28 05:17:34,785 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/data/2995c6de7/ae6ad21298a043259038de248a1eb5dc [2024-11-28 05:17:34,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:17:34,789 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:17:34,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:17:34,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:17:34,795 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:17:34,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:17:34" (1/1) ... [2024-11-28 05:17:34,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85aa763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:34, skipping insertion in model container [2024-11-28 05:17:34,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:17:34" (1/1) ... [2024-11-28 05:17:34,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:17:35,301 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:17:35,343 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:17:35,348 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:17:35,353 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:17:35,363 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:17:35,380 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:17:35,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:17:35,398 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:17:35,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:17:35,572 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:17:35,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:35 WrapperNode [2024-11-28 05:17:35,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:17:35,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:17:35,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:17:35,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:17:35,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:35" (1/1) ... [2024-11-28 05:17:35,604 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:35" (1/1) ... [2024-11-28 05:17:35,642 INFO L138 Inliner]: procedures = 179, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 622 [2024-11-28 05:17:35,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:17:35,643 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:17:35,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:17:35,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:17:35,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:35" (1/1) ... [2024-11-28 05:17:35,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:35" (1/1) ... [2024-11-28 05:17:35,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:35" (1/1) ... [2024-11-28 05:17:35,715 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-11-28 05:17:35,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:35" (1/1) ... [2024-11-28 05:17:35,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:35" (1/1) ... [2024-11-28 05:17:35,746 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:35" (1/1) ... [2024-11-28 05:17:35,747 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:35" (1/1) ... [2024-11-28 05:17:35,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:35" (1/1) ... [2024-11-28 05:17:35,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:35" (1/1) ... [2024-11-28 05:17:35,775 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:35" (1/1) ... [2024-11-28 05:17:35,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:17:35,786 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:17:35,790 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:17:35,790 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:17:35,791 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:35" (1/1) ... [2024-11-28 05:17:35,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:17:35,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:17:35,834 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:17:35,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:17:35,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-28 05:17:35,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-28 05:17:35,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-28 05:17:35,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-28 05:17:35,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 05:17:35,866 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 05:17:35,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-28 05:17:35,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-28 05:17:35,867 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-28 05:17:35,867 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-28 05:17:35,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 05:17:35,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:17:35,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 05:17:35,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 05:17:35,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 05:17:35,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 05:17:35,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 05:17:35,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-28 05:17:35,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-28 05:17:35,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 05:17:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 05:17:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:17:35,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:17:36,090 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:17:36,091 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:17:36,094 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 05:17:36,149 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 05:17:39,236 INFO L? ?]: Removed 686 outVars from TransFormulas that were not future-live. [2024-11-28 05:17:39,236 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:17:39,271 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:17:39,275 INFO L312 CfgBuilder]: Removed 18 assume(true) statements. [2024-11-28 05:17:39,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:17:39 BoogieIcfgContainer [2024-11-28 05:17:39,278 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:17:39,280 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:17:39,280 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:17:39,285 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:17:39,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:17:34" (1/3) ... [2024-11-28 05:17:39,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ced104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:17:39, skipping insertion in model container [2024-11-28 05:17:39,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:35" (2/3) ... [2024-11-28 05:17:39,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ced104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:17:39, skipping insertion in model container [2024-11-28 05:17:39,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:17:39" (3/3) ... [2024-11-28 05:17:39,290 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test1-1.i [2024-11-28 05:17:39,304 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:17:39,306 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test1-1.i that has 4 procedures, 663 locations, 1 initial locations, 20 loop locations, and 320 error locations. [2024-11-28 05:17:39,353 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:17:39,365 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@45650548, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:17:39,365 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-28 05:17:39,371 INFO L276 IsEmpty]: Start isEmpty. Operand has 658 states, 325 states have (on average 2.2) internal successors, (715), 652 states have internal predecessors, (715), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:17:39,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 05:17:39,376 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:39,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 05:17:39,377 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:17:39,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:39,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103276, now seen corresponding path program 1 times [2024-11-28 05:17:39,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:17:39,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [83292777] [2024-11-28 05:17:39,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:39,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:17:39,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:17:39,397 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:17:39,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 05:17:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:39,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 05:17:39,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:17:39,550 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-28 05:17:39,550 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:17:39,551 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:17:39,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83292777] [2024-11-28 05:17:39,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83292777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:39,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:39,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:17:39,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594937680] [2024-11-28 05:17:39,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:39,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 05:17:39,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:17:39,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 05:17:39,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 05:17:39,592 INFO L87 Difference]: Start difference. First operand has 658 states, 325 states have (on average 2.2) internal successors, (715), 652 states have internal predecessors, (715), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:39,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:39,667 INFO L93 Difference]: Finished difference Result 648 states and 694 transitions. [2024-11-28 05:17:39,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 05:17:39,669 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 05:17:39,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:39,693 INFO L225 Difference]: With dead ends: 648 [2024-11-28 05:17:39,693 INFO L226 Difference]: Without dead ends: 646 [2024-11-28 05:17:39,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 05:17:39,697 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:39,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:39,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-11-28 05:17:39,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2024-11-28 05:17:39,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 319 states have (on average 2.0877742946708464) internal successors, (666), 640 states have internal predecessors, (666), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:17:39,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 692 transitions. [2024-11-28 05:17:39,806 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 692 transitions. Word has length 6 [2024-11-28 05:17:39,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:39,807 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 692 transitions. [2024-11-28 05:17:39,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:39,807 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 692 transitions. [2024-11-28 05:17:39,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 05:17:39,807 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:39,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 05:17:39,820 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 05:17:40,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:17:40,015 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:17:40,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:40,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103338, now seen corresponding path program 1 times [2024-11-28 05:17:40,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:17:40,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [304918190] [2024-11-28 05:17:40,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:40,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:17:40,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:17:40,019 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:17:40,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 05:17:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:40,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 05:17:40,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:17:40,197 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-28 05:17:40,219 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-28 05:17:40,219 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:17:40,220 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:17:40,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304918190] [2024-11-28 05:17:40,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304918190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:40,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:40,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:17:40,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796663518] [2024-11-28 05:17:40,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:40,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:40,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:17:40,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:40,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:40,222 INFO L87 Difference]: Start difference. First operand 646 states and 692 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-28 05:17:41,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:41,683 INFO L93 Difference]: Finished difference Result 600 states and 647 transitions. [2024-11-28 05:17:41,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:41,683 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-28 05:17:41,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:41,686 INFO L225 Difference]: With dead ends: 600 [2024-11-28 05:17:41,686 INFO L226 Difference]: Without dead ends: 600 [2024-11-28 05:17:41,686 INFO L434 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-28 05:17:41,687 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 536 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:41,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 348 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 05:17:41,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-28 05:17:41,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 597. [2024-11-28 05:17:41,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 319 states have (on average 1.9341692789968652) internal successors, (617), 591 states have internal predecessors, (617), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:17:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 643 transitions. [2024-11-28 05:17:41,727 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 643 transitions. Word has length 6 [2024-11-28 05:17:41,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:41,727 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 643 transitions. [2024-11-28 05:17:41,727 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-28 05:17:41,727 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 643 transitions. [2024-11-28 05:17:41,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 05:17:41,728 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:41,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 05:17:41,739 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 05:17:41,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:17:41,928 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:17:41,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:41,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103339, now seen corresponding path program 1 times [2024-11-28 05:17:41,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:17:41,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2005538087] [2024-11-28 05:17:41,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:41,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:17:41,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:17:41,931 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:17:41,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 05:17:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:42,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 05:17:42,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:17:42,044 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-28 05:17:42,070 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-28 05:17:42,071 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:17:42,071 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:17:42,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005538087] [2024-11-28 05:17:42,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005538087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:42,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:42,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:17:42,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339446915] [2024-11-28 05:17:42,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:42,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:42,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:17:42,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:42,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:42,073 INFO L87 Difference]: Start difference. First operand 597 states and 643 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-28 05:17:43,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:43,660 INFO L93 Difference]: Finished difference Result 673 states and 723 transitions. [2024-11-28 05:17:43,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:43,661 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-28 05:17:43,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:43,664 INFO L225 Difference]: With dead ends: 673 [2024-11-28 05:17:43,664 INFO L226 Difference]: Without dead ends: 673 [2024-11-28 05:17:43,664 INFO L434 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-28 05:17:43,665 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 264 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:43,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 736 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-28 05:17:43,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-11-28 05:17:43,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 624. [2024-11-28 05:17:43,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 356 states have (on average 1.9129213483146068) internal successors, (681), 618 states have internal predecessors, (681), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:17:43,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 707 transitions. [2024-11-28 05:17:43,683 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 707 transitions. Word has length 6 [2024-11-28 05:17:43,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:43,684 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 707 transitions. [2024-11-28 05:17:43,684 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-28 05:17:43,684 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 707 transitions. [2024-11-28 05:17:43,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 05:17:43,684 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:43,684 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 05:17:43,691 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 05:17:43,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:17:43,885 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:17:43,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:43,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1423050696, now seen corresponding path program 1 times [2024-11-28 05:17:43,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:17:43,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [773996375] [2024-11-28 05:17:43,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:43,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:17:43,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:17:43,894 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:17:43,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 05:17:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:43,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 05:17:43,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:17:44,031 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-28 05:17:44,031 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:17:44,031 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:17:44,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773996375] [2024-11-28 05:17:44,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773996375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:44,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:44,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:17:44,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546523838] [2024-11-28 05:17:44,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:44,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:17:44,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:17:44,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:17:44,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:17:44,033 INFO L87 Difference]: Start difference. First operand 624 states and 707 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:44,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:44,648 INFO L93 Difference]: Finished difference Result 753 states and 849 transitions. [2024-11-28 05:17:44,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:17:44,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 05:17:44,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:44,652 INFO L225 Difference]: With dead ends: 753 [2024-11-28 05:17:44,652 INFO L226 Difference]: Without dead ends: 753 [2024-11-28 05:17:44,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:17:44,653 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 138 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:44,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1756 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 05:17:44,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-11-28 05:17:44,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 707. [2024-11-28 05:17:44,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 439 states have (on average 1.8747152619589977) internal successors, (823), 701 states have internal predecessors, (823), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:17:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 849 transitions. [2024-11-28 05:17:44,674 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 849 transitions. Word has length 6 [2024-11-28 05:17:44,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:44,674 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 849 transitions. [2024-11-28 05:17:44,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:44,675 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 849 transitions. [2024-11-28 05:17:44,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-28 05:17:44,675 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:44,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:17:44,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 05:17:44,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:17:44,879 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr318ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:17:44,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:44,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1164903939, now seen corresponding path program 1 times [2024-11-28 05:17:44,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:17:44,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1151879063] [2024-11-28 05:17:44,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:44,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:17:44,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:17:44,883 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:17:44,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 05:17:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:44,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 05:17:44,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:17:44,986 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-28 05:17:44,986 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:17:44,986 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:17:44,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151879063] [2024-11-28 05:17:44,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151879063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:44,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:44,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:17:44,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335136565] [2024-11-28 05:17:44,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:44,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:44,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:17:44,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:44,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:44,988 INFO L87 Difference]: Start difference. First operand 707 states and 849 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:45,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:45,889 INFO L93 Difference]: Finished difference Result 709 states and 850 transitions. [2024-11-28 05:17:45,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:45,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-28 05:17:45,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:45,892 INFO L225 Difference]: With dead ends: 709 [2024-11-28 05:17:45,893 INFO L226 Difference]: Without dead ends: 705 [2024-11-28 05:17:45,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-28 05:17:45,893 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 1 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:45,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 997 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 05:17:45,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-11-28 05:17:45,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2024-11-28 05:17:45,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 437 states have (on average 1.8764302059496567) internal successors, (820), 699 states have internal predecessors, (820), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:17:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 846 transitions. [2024-11-28 05:17:45,917 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 846 transitions. Word has length 7 [2024-11-28 05:17:45,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:45,917 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 846 transitions. [2024-11-28 05:17:45,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:45,917 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 846 transitions. [2024-11-28 05:17:45,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 05:17:45,918 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:45,918 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:17:45,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 05:17:46,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:17:46,118 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:17:46,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:46,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1783262039, now seen corresponding path program 1 times [2024-11-28 05:17:46,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:17:46,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1686695985] [2024-11-28 05:17:46,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:46,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:17:46,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:17:46,121 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:17:46,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 05:17:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:46,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 05:17:46,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:17:46,245 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-28 05:17:46,292 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-28 05:17:46,292 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:17:46,292 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:17:46,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686695985] [2024-11-28 05:17:46,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686695985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:46,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:46,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:46,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123945026] [2024-11-28 05:17:46,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:46,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:17:46,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:17:46,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:17:46,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:17:46,293 INFO L87 Difference]: Start difference. First operand 705 states and 846 transitions. Second operand has 4 states, 3 states have (on average 4.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-28 05:17:48,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:48,189 INFO L93 Difference]: Finished difference Result 690 states and 808 transitions. [2024-11-28 05:17:48,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:17:48,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.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-28 05:17:48,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:48,192 INFO L225 Difference]: With dead ends: 690 [2024-11-28 05:17:48,192 INFO L226 Difference]: Without dead ends: 690 [2024-11-28 05:17:48,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-28 05:17:48,193 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 587 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:48,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 544 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-28 05:17:48,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-28 05:17:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 682. [2024-11-28 05:17:48,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 437 states have (on average 1.77116704805492) internal successors, (774), 676 states have internal predecessors, (774), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:17:48,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 800 transitions. [2024-11-28 05:17:48,211 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 800 transitions. Word has length 12 [2024-11-28 05:17:48,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:48,212 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 800 transitions. [2024-11-28 05:17:48,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.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-28 05:17:48,212 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 800 transitions. [2024-11-28 05:17:48,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 05:17:48,213 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:48,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:17:48,224 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 05:17:48,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:17:48,417 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:17:48,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:48,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1783262040, now seen corresponding path program 1 times [2024-11-28 05:17:48,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:17:48,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2089231709] [2024-11-28 05:17:48,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:48,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:17:48,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:17:48,419 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:17:48,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 05:17:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:48,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 05:17:48,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:17:48,546 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-28 05:17:48,661 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-28 05:17:48,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:17:48,661 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:17:48,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089231709] [2024-11-28 05:17:48,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089231709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:48,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:48,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:48,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145453423] [2024-11-28 05:17:48,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:48,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:17:48,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:17:48,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:17:48,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:17:48,663 INFO L87 Difference]: Start difference. First operand 682 states and 800 transitions. Second operand has 4 states, 3 states have (on average 4.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-28 05:17:51,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:51,212 INFO L93 Difference]: Finished difference Result 863 states and 972 transitions. [2024-11-28 05:17:51,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:17:51,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.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-28 05:17:51,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:51,216 INFO L225 Difference]: With dead ends: 863 [2024-11-28 05:17:51,216 INFO L226 Difference]: Without dead ends: 863 [2024-11-28 05:17:51,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-28 05:17:51,217 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 389 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:51,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1148 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-28 05:17:51,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-11-28 05:17:51,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 798. [2024-11-28 05:17:51,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 553 states have (on average 1.6528028933092225) internal successors, (914), 792 states have internal predecessors, (914), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:17:51,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 940 transitions. [2024-11-28 05:17:51,238 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 940 transitions. Word has length 12 [2024-11-28 05:17:51,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:51,239 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 940 transitions. [2024-11-28 05:17:51,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.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-28 05:17:51,239 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 940 transitions. [2024-11-28 05:17:51,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 05:17:51,241 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:51,241 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:17:51,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 05:17:51,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:17:51,445 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:17:51,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:51,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1048779893, now seen corresponding path program 1 times [2024-11-28 05:17:51,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:17:51,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [962791231] [2024-11-28 05:17:51,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:51,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:17:51,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:17:51,448 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:17:51,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 05:17:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:51,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 05:17:51,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:17:51,642 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-28 05:17:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:51,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:17:52,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:52,494 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:17:52,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962791231] [2024-11-28 05:17:52,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962791231] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:17:52,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:17:52,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-28 05:17:52,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210292887] [2024-11-28 05:17:52,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:17:52,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 05:17:52,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:17:52,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 05:17:52,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:17:52,496 INFO L87 Difference]: Start difference. First operand 798 states and 940 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:58,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:58,834 INFO L93 Difference]: Finished difference Result 1225 states and 1468 transitions. [2024-11-28 05:17:58,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:17:58,835 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-28 05:17:58,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:58,840 INFO L225 Difference]: With dead ends: 1225 [2024-11-28 05:17:58,840 INFO L226 Difference]: Without dead ends: 1225 [2024-11-28 05:17:58,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:17:58,841 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 1030 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 1830 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:58,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1031 Valid, 1830 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-28 05:17:58,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2024-11-28 05:17:58,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 964. [2024-11-28 05:17:58,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 719 states have (on average 1.5966620305980528) internal successors, (1148), 958 states have internal predecessors, (1148), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:17:58,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1174 transitions. [2024-11-28 05:17:58,869 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1174 transitions. Word has length 31 [2024-11-28 05:17:58,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:58,869 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1174 transitions. [2024-11-28 05:17:58,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:58,869 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1174 transitions. [2024-11-28 05:17:58,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 05:17:58,882 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:58,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:17:58,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 05:17:59,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:17:59,083 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:17:59,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:59,084 INFO L85 PathProgramCache]: Analyzing trace with hash -717313938, now seen corresponding path program 1 times [2024-11-28 05:17:59,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:17:59,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [941352926] [2024-11-28 05:17:59,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:59,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:17:59,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:17:59,087 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:17:59,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 05:17:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:59,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 05:17:59,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:17:59,303 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-28 05:17:59,303 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:17:59,303 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:17:59,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941352926] [2024-11-28 05:17:59,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941352926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:59,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:59,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:17:59,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925503813] [2024-11-28 05:17:59,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:59,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:17:59,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:17:59,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:17:59,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:17:59,305 INFO L87 Difference]: Start difference. First operand 964 states and 1174 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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-28 05:17:59,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:59,437 INFO L93 Difference]: Finished difference Result 649 states and 734 transitions. [2024-11-28 05:17:59,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:17:59,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-11-28 05:17:59,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:59,440 INFO L225 Difference]: With dead ends: 649 [2024-11-28 05:17:59,440 INFO L226 Difference]: Without dead ends: 649 [2024-11-28 05:17:59,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-28 05:17:59,441 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 56 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:59,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1571 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:17:59,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-28 05:17:59,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 647. [2024-11-28 05:17:59,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 425 states have (on average 1.6611764705882353) internal successors, (706), 641 states have internal predecessors, (706), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:17:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 732 transitions. [2024-11-28 05:17:59,459 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 732 transitions. Word has length 47 [2024-11-28 05:17:59,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:59,459 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 732 transitions. [2024-11-28 05:17:59,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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-28 05:17:59,460 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 732 transitions. [2024-11-28 05:17:59,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 05:17:59,463 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:59,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:17:59,477 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 05:17:59,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:17:59,664 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:17:59,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:59,664 INFO L85 PathProgramCache]: Analyzing trace with hash 489889826, now seen corresponding path program 1 times [2024-11-28 05:17:59,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:17:59,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [293976440] [2024-11-28 05:17:59,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:59,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:17:59,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:17:59,667 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:17:59,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 05:17:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:59,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 05:17:59,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:17:59,844 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-28 05:18:00,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:18:00,446 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 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 05:18:00,469 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:18:00,469 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-28 05:18:00,479 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-28 05:18:00,479 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:18:00,479 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:18:00,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293976440] [2024-11-28 05:18:00,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293976440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:18:00,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:18:00,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:18:00,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068966755] [2024-11-28 05:18:00,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:18:00,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:18:00,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:18:00,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:18:00,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:18:00,480 INFO L87 Difference]: Start difference. First operand 647 states and 732 transitions. Second operand has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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-28 05:18:02,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:02,381 INFO L93 Difference]: Finished difference Result 609 states and 694 transitions. [2024-11-28 05:18:02,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:18:02,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-11-28 05:18:02,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:02,384 INFO L225 Difference]: With dead ends: 609 [2024-11-28 05:18:02,384 INFO L226 Difference]: Without dead ends: 609 [2024-11-28 05:18:02,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:18:02,386 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 452 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:18:02,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 431 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 05:18:02,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-28 05:18:02,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 572. [2024-11-28 05:18:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 388 states have (on average 1.5309278350515463) internal successors, (594), 566 states have internal predecessors, (594), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:18:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 620 transitions. [2024-11-28 05:18:02,399 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 620 transitions. Word has length 55 [2024-11-28 05:18:02,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:02,399 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 620 transitions. [2024-11-28 05:18:02,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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-28 05:18:02,399 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 620 transitions. [2024-11-28 05:18:02,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-28 05:18:02,400 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:02,401 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:18:02,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-28 05:18:02,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:18:02,601 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:18:02,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:02,603 INFO L85 PathProgramCache]: Analyzing trace with hash 225246615, now seen corresponding path program 1 times [2024-11-28 05:18:02,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:18:02,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2025014429] [2024-11-28 05:18:02,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:02,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:18:02,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:18:02,605 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:18:02,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 05:18:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:02,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 05:18:02,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:18:02,788 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-28 05:18:02,810 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 19 treesize of output 1 [2024-11-28 05:18:02,855 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 23 treesize of output 11 [2024-11-28 05:18:02,864 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-28 05:18:02,865 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:18:02,865 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:18:02,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025014429] [2024-11-28 05:18:02,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025014429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:18:02,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:18:02,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:18:02,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16406588] [2024-11-28 05:18:02,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:18:02,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:18:02,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:18:02,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:18:02,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:18:02,866 INFO L87 Difference]: Start difference. First operand 572 states and 620 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:18:04,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:04,552 INFO L93 Difference]: Finished difference Result 571 states and 619 transitions. [2024-11-28 05:18:04,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:18:04,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-28 05:18:04,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:04,554 INFO L225 Difference]: With dead ends: 571 [2024-11-28 05:18:04,554 INFO L226 Difference]: Without dead ends: 571 [2024-11-28 05:18:04,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:18:04,554 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 2 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:18:04,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1376 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-28 05:18:04,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2024-11-28 05:18:04,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2024-11-28 05:18:04,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 388 states have (on average 1.5283505154639174) internal successors, (593), 565 states have internal predecessors, (593), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:18:04,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 619 transitions. [2024-11-28 05:18:04,566 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 619 transitions. Word has length 60 [2024-11-28 05:18:04,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:04,566 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 619 transitions. [2024-11-28 05:18:04,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:18:04,566 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 619 transitions. [2024-11-28 05:18:04,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-28 05:18:04,567 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:04,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:18:04,580 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-28 05:18:04,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:18:04,768 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:18:04,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:04,768 INFO L85 PathProgramCache]: Analyzing trace with hash 225246616, now seen corresponding path program 1 times [2024-11-28 05:18:04,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:18:04,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [102789868] [2024-11-28 05:18:04,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:04,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:18:04,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:18:04,771 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:18:04,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 05:18:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:04,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 05:18:04,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:18:05,006 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-28 05:18:05,034 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-28 05:18:05,051 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 19 treesize of output 1 [2024-11-28 05:18:05,115 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 21 treesize of output 9 [2024-11-28 05:18:05,141 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-28 05:18:05,141 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:18:05,141 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:18:05,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102789868] [2024-11-28 05:18:05,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102789868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:18:05,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:18:05,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:18:05,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849300273] [2024-11-28 05:18:05,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:18:05,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:18:05,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:18:05,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:18:05,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:18:05,142 INFO L87 Difference]: Start difference. First operand 571 states and 619 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:18:07,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:07,137 INFO L93 Difference]: Finished difference Result 570 states and 618 transitions. [2024-11-28 05:18:07,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:18:07,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-28 05:18:07,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:07,139 INFO L225 Difference]: With dead ends: 570 [2024-11-28 05:18:07,139 INFO L226 Difference]: Without dead ends: 570 [2024-11-28 05:18:07,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:18:07,140 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 1 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:18:07,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1383 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-28 05:18:07,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-11-28 05:18:07,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2024-11-28 05:18:07,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 387 states have (on average 1.5297157622739017) internal successors, (592), 564 states have internal predecessors, (592), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:18:07,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 618 transitions. [2024-11-28 05:18:07,151 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 618 transitions. Word has length 60 [2024-11-28 05:18:07,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:07,151 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 618 transitions. [2024-11-28 05:18:07,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:18:07,152 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 618 transitions. [2024-11-28 05:18:07,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 05:18:07,153 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:07,154 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:18:07,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-28 05:18:07,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:18:07,355 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:18:07,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:07,355 INFO L85 PathProgramCache]: Analyzing trace with hash -815907298, now seen corresponding path program 1 times [2024-11-28 05:18:07,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:18:07,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2066484668] [2024-11-28 05:18:07,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:07,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:18:07,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:18:07,357 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:18:07,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 05:18:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:07,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 05:18:07,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:18:07,587 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 19 treesize of output 1 [2024-11-28 05:18:07,688 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 23 treesize of output 11 [2024-11-28 05:18:07,706 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-28 05:18:07,707 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:18:07,707 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:18:07,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066484668] [2024-11-28 05:18:07,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066484668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:18:07,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:18:07,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 05:18:07,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286572790] [2024-11-28 05:18:07,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:18:07,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:18:07,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:18:07,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:18:07,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:18:07,710 INFO L87 Difference]: Start difference. First operand 570 states and 618 transitions. Second operand has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:18:09,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:09,915 INFO L93 Difference]: Finished difference Result 582 states and 633 transitions. [2024-11-28 05:18:09,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:18:09,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2024-11-28 05:18:09,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:09,918 INFO L225 Difference]: With dead ends: 582 [2024-11-28 05:18:09,918 INFO L226 Difference]: Without dead ends: 582 [2024-11-28 05:18:09,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:18:09,919 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 12 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:18:09,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1810 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 05:18:09,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-11-28 05:18:09,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 576. [2024-11-28 05:18:09,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 392 states have (on average 1.528061224489796) internal successors, (599), 569 states have internal predecessors, (599), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-28 05:18:09,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 628 transitions. [2024-11-28 05:18:09,936 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 628 transitions. Word has length 68 [2024-11-28 05:18:09,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:09,936 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 628 transitions. [2024-11-28 05:18:09,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:18:09,937 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 628 transitions. [2024-11-28 05:18:09,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 05:18:09,938 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:09,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:18:09,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 05:18:10,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:18:10,139 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:18:10,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:10,140 INFO L85 PathProgramCache]: Analyzing trace with hash -815907297, now seen corresponding path program 1 times [2024-11-28 05:18:10,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:18:10,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [738944613] [2024-11-28 05:18:10,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:10,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:18:10,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:18:10,143 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:18:10,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 05:18:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:10,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 05:18:10,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:18:10,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-28 05:18:10,387 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:18:10,387 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:18:10,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738944613] [2024-11-28 05:18:10,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738944613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:18:10,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:18:10,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:18:10,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085942052] [2024-11-28 05:18:10,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:18:10,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:18:10,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:18:10,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:18:10,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:18:10,389 INFO L87 Difference]: Start difference. First operand 576 states and 628 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:18:10,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:10,442 INFO L93 Difference]: Finished difference Result 573 states and 622 transitions. [2024-11-28 05:18:10,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:18:10,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2024-11-28 05:18:10,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:10,446 INFO L225 Difference]: With dead ends: 573 [2024-11-28 05:18:10,448 INFO L226 Difference]: Without dead ends: 573 [2024-11-28 05:18:10,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:18:10,449 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 0 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:18:10,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1558 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:18:10,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2024-11-28 05:18:10,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2024-11-28 05:18:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 389 states have (on average 1.5295629820051413) internal successors, (595), 567 states have internal predecessors, (595), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:18:10,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 622 transitions. [2024-11-28 05:18:10,466 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 622 transitions. Word has length 68 [2024-11-28 05:18:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:10,466 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 622 transitions. [2024-11-28 05:18:10,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:18:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 622 transitions. [2024-11-28 05:18:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-28 05:18:10,467 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:10,467 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:18:10,481 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 05:18:10,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:18:10,668 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:18:10,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:10,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2041001009, now seen corresponding path program 1 times [2024-11-28 05:18:10,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:18:10,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1559186179] [2024-11-28 05:18:10,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:10,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:18:10,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:18:10,671 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:18:10,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 05:18:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:10,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 05:18:10,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:18:10,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:18:10,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:18:10,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:18:10,979 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:18:10,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559186179] [2024-11-28 05:18:10,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559186179] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:18:10,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:18:10,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-28 05:18:10,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232786113] [2024-11-28 05:18:10,980 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:18:10,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 05:18:10,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:18:10,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 05:18:10,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:18:10,981 INFO L87 Difference]: Start difference. First operand 573 states and 622 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 05:18:11,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:11,218 INFO L93 Difference]: Finished difference Result 585 states and 639 transitions. [2024-11-28 05:18:11,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:18:11,219 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2024-11-28 05:18:11,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:11,221 INFO L225 Difference]: With dead ends: 585 [2024-11-28 05:18:11,221 INFO L226 Difference]: Without dead ends: 585 [2024-11-28 05:18:11,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-28 05:18:11,224 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 5 mSDsluCounter, 2586 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3107 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:18:11,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3107 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:18:11,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-28 05:18:11,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 583. [2024-11-28 05:18:11,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 398 states have (on average 1.5326633165829147) internal successors, (610), 576 states have internal predecessors, (610), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:18:11,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 637 transitions. [2024-11-28 05:18:11,239 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 637 transitions. Word has length 69 [2024-11-28 05:18:11,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:11,240 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 637 transitions. [2024-11-28 05:18:11,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 05:18:11,240 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 637 transitions. [2024-11-28 05:18:11,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-28 05:18:11,241 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:11,241 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:18:11,254 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-28 05:18:11,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:18:11,442 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:18:11,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:11,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1795904802, now seen corresponding path program 2 times [2024-11-28 05:18:11,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:18:11,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1799030366] [2024-11-28 05:18:11,443 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:18:11,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:18:11,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:18:11,445 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:18:11,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 05:18:17,560 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:18:17,560 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:18:17,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-28 05:18:17,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:18:17,711 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:18:17,711 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-28 05:18:17,735 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-28 05:18:17,958 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:18:17,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 05:18:18,016 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-28 05:18:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-28 05:18:18,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:18:18,139 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-28 05:18:18,139 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 25 treesize of output 24 [2024-11-28 05:18:18,227 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:18:18,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799030366] [2024-11-28 05:18:18,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799030366] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:18:18,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [904870054] [2024-11-28 05:18:18,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:18:18,227 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:18:18,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:18:18,232 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:18:18,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-11-28 05:18:19,095 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:18:19,095 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:18:19,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 05:18:19,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:18:19,355 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:18:19,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:18:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:18:19,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [904870054] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:18:19,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:18:19,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 24 [2024-11-28 05:18:19,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042069731] [2024-11-28 05:18:19,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:18:19,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 05:18:19,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:18:19,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 05:18:19,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=552, Unknown=7, NotChecked=0, Total=650 [2024-11-28 05:18:19,731 INFO L87 Difference]: Start difference. First operand 583 states and 637 transitions. Second operand has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 05:18:29,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:29,362 INFO L93 Difference]: Finished difference Result 599 states and 659 transitions. [2024-11-28 05:18:29,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-28 05:18:29,363 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 72 [2024-11-28 05:18:29,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:29,366 INFO L225 Difference]: With dead ends: 599 [2024-11-28 05:18:29,366 INFO L226 Difference]: Without dead ends: 593 [2024-11-28 05:18:29,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=395, Invalid=2248, Unknown=9, NotChecked=0, Total=2652 [2024-11-28 05:18:29,367 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 499 mSDsluCounter, 3400 mSDsCounter, 0 mSdLazyCounter, 3937 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 3685 SdHoareTripleChecker+Invalid, 3973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:18:29,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 3685 Invalid, 3973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3937 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2024-11-28 05:18:29,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-11-28 05:18:29,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2024-11-28 05:18:29,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 407 states have (on average 1.5233415233415233) internal successors, (620), 584 states have internal predecessors, (620), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:18:29,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 647 transitions. [2024-11-28 05:18:29,378 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 647 transitions. Word has length 72 [2024-11-28 05:18:29,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:29,378 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 647 transitions. [2024-11-28 05:18:29,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 05:18:29,378 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 647 transitions. [2024-11-28 05:18:29,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-28 05:18:29,379 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:29,379 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:18:29,406 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-28 05:18:29,584 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2024-11-28 05:18:29,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 05:18:29,780 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:18:29,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:29,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1559042559, now seen corresponding path program 1 times [2024-11-28 05:18:29,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:18:29,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1726809048] [2024-11-28 05:18:29,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:29,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:18:29,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:18:29,783 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:18:29,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-28 05:18:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:30,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-28 05:18:30,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:18:30,216 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:18:30,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:18:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:18:30,866 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:18:30,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726809048] [2024-11-28 05:18:30,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726809048] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:18:30,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:18:30,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-28 05:18:30,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878357816] [2024-11-28 05:18:30,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:18:30,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 05:18:30,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:18:30,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 05:18:30,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-28 05:18:30,868 INFO L87 Difference]: Start difference. First operand 591 states and 647 transitions. Second operand has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 05:18:33,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:33,785 INFO L93 Difference]: Finished difference Result 615 states and 686 transitions. [2024-11-28 05:18:33,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-28 05:18:33,786 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 78 [2024-11-28 05:18:33,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:33,788 INFO L225 Difference]: With dead ends: 615 [2024-11-28 05:18:33,788 INFO L226 Difference]: Without dead ends: 609 [2024-11-28 05:18:33,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-28 05:18:33,790 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 18 mSDsluCounter, 5700 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 6221 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:18:33,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 6221 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-28 05:18:33,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-28 05:18:33,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-28 05:18:33,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 425 states have (on average 1.5129411764705882) internal successors, (643), 602 states have internal predecessors, (643), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:18:33,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 670 transitions. [2024-11-28 05:18:33,802 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 670 transitions. Word has length 78 [2024-11-28 05:18:33,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:33,802 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 670 transitions. [2024-11-28 05:18:33,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 05:18:33,802 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 670 transitions. [2024-11-28 05:18:33,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-28 05:18:33,803 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:33,803 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:18:33,817 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-28 05:18:34,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:18:34,004 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:18:34,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:34,004 INFO L85 PathProgramCache]: Analyzing trace with hash -276271041, now seen corresponding path program 2 times [2024-11-28 05:18:34,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:18:34,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [34961537] [2024-11-28 05:18:34,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:18:34,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:18:34,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:18:34,006 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:18:34,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-28 05:18:37,756 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:18:37,757 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:18:37,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-28 05:18:37,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:18:37,918 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:18:37,918 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-28 05:18:37,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-28 05:18:37,959 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-28 05:18:37,965 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-28 05:18:38,091 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 22 treesize of output 10 [2024-11-28 05:18:38,101 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-28 05:18:38,700 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:18:38,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:18:38,715 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 30 treesize of output 13 [2024-11-28 05:18:38,769 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-28 05:18:38,775 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-28 05:18:38,812 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-28 05:18:38,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:18:39,392 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_975 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_974) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_974 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_974) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2024-11-28 05:18:39,398 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:18:39,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34961537] [2024-11-28 05:18:39,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34961537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:18:39,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [242794242] [2024-11-28 05:18:39,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:18:39,399 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:18:39,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:18:39,400 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:18:39,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-28 05:18:40,398 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:18:40,398 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:18:40,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-28 05:18:40,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:18:41,689 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:18:41,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:18:44,835 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:18:44,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [242794242] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:18:44,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:18:44,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 26, 26] total 58 [2024-11-28 05:18:44,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195987641] [2024-11-28 05:18:44,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:18:44,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-28 05:18:44,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:18:44,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-28 05:18:44,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660 [2024-11-28 05:18:44,840 INFO L87 Difference]: Start difference. First operand 609 states and 670 transitions. Second operand has 58 states, 57 states have (on average 3.017543859649123) internal successors, (172), 58 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 05:19:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:19:23,961 INFO L93 Difference]: Finished difference Result 656 states and 747 transitions. [2024-11-28 05:19:23,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-11-28 05:19:23,962 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 3.017543859649123) internal successors, (172), 58 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 90 [2024-11-28 05:19:23,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:19:23,964 INFO L225 Difference]: With dead ends: 656 [2024-11-28 05:19:23,964 INFO L226 Difference]: Without dead ends: 644 [2024-11-28 05:19:23,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 136 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3244 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=3205, Invalid=15430, Unknown=1, NotChecked=270, Total=18906 [2024-11-28 05:19:23,968 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 513 mSDsluCounter, 7779 mSDsCounter, 0 mSdLazyCounter, 9933 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 8070 SdHoareTripleChecker+Invalid, 9972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 9933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:19:23,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 8070 Invalid, 9972 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [39 Valid, 9933 Invalid, 0 Unknown, 0 Unchecked, 28.1s Time] [2024-11-28 05:19:23,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-11-28 05:19:23,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2024-11-28 05:19:23,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 461 states have (on average 1.4880694143167028) internal successors, (686), 637 states have internal predecessors, (686), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:19:23,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 713 transitions. [2024-11-28 05:19:23,979 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 713 transitions. Word has length 90 [2024-11-28 05:19:23,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:19:23,980 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 713 transitions. [2024-11-28 05:19:23,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 3.017543859649123) internal successors, (172), 58 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 05:19:23,980 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 713 transitions. [2024-11-28 05:19:23,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-28 05:19:23,981 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:19:23,981 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:19:23,989 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2024-11-28 05:19:24,208 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-28 05:19:24,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:19:24,382 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:19:24,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:19:24,383 INFO L85 PathProgramCache]: Analyzing trace with hash -419521111, now seen corresponding path program 1 times [2024-11-28 05:19:24,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:19:24,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [634362751] [2024-11-28 05:19:24,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:19:24,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:19:24,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:19:24,385 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:19:24,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-28 05:19:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:19:24,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-28 05:19:24,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:19:24,817 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-28 05:19:24,937 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:19:24,938 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-28 05:19:24,961 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-28 05:19:25,555 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:19:25,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 05:19:25,659 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:19:25,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 05:19:25,675 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-28 05:19:25,696 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 05:19:25,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:19:25,733 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_1528) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-28 05:19:25,741 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1528) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 05:19:26,199 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-28 05:19:26,199 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 37 treesize of output 36 [2024-11-28 05:19:26,210 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1528 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1574))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1528)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem32#1.base|)) is different from false [2024-11-28 05:19:26,213 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:19:26,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634362751] [2024-11-28 05:19:26,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634362751] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:19:26,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1548416771] [2024-11-28 05:19:26,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:19:26,213 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:19:26,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:19:26,215 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:19:26,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-28 05:19:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:19:29,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-28 05:19:29,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:19:29,157 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-28 05:19:29,158 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 20 [2024-11-28 05:19:29,592 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-28 05:19:29,592 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 26 treesize of output 43 [2024-11-28 05:19:29,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 05:19:29,990 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 34 treesize of output 16 [2024-11-28 05:19:31,677 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:19:31,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2024-11-28 05:19:31,938 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:19:31,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2024-11-28 05:19:31,979 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 43 treesize of output 19 [2024-11-28 05:19:32,054 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 05:19:32,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:19:32,070 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_1944) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-28 05:19:32,080 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1944) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 05:19:32,579 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1990))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1944)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:19:32,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1548416771] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:19:32,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:19:32,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 20 [2024-11-28 05:19:32,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54866102] [2024-11-28 05:19:32,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:19:32,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 05:19:32,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:19:32,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 05:19:32,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=385, Unknown=6, NotChecked=270, Total=756 [2024-11-28 05:19:32,584 INFO L87 Difference]: Start difference. First operand 644 states and 713 transitions. Second operand has 21 states, 18 states have (on average 7.888888888888889) internal successors, (142), 20 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:19:39,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:19:39,318 INFO L93 Difference]: Finished difference Result 1159 states and 1288 transitions. [2024-11-28 05:19:39,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-28 05:19:39,319 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 7.888888888888889) internal successors, (142), 20 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 115 [2024-11-28 05:19:39,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:19:39,322 INFO L225 Difference]: With dead ends: 1159 [2024-11-28 05:19:39,322 INFO L226 Difference]: Without dead ends: 1159 [2024-11-28 05:19:39,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=203, Invalid=1005, Unknown=6, NotChecked=426, Total=1640 [2024-11-28 05:19:39,323 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 1162 mSDsluCounter, 2277 mSDsCounter, 0 mSdLazyCounter, 2697 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 2546 SdHoareTripleChecker+Invalid, 2762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:19:39,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 2546 Invalid, 2762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2697 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-28 05:19:39,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2024-11-28 05:19:39,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 643. [2024-11-28 05:19:39,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 461 states have (on average 1.4859002169197397) internal successors, (685), 636 states have internal predecessors, (685), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:19:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 712 transitions. [2024-11-28 05:19:39,340 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 712 transitions. Word has length 115 [2024-11-28 05:19:39,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:19:39,340 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 712 transitions. [2024-11-28 05:19:39,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 7.888888888888889) internal successors, (142), 20 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:19:39,341 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 712 transitions. [2024-11-28 05:19:39,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-28 05:19:39,342 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:19:39,342 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:19:39,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2024-11-28 05:19:39,553 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-28 05:19:39,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:19:39,742 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:19:39,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:19:39,743 INFO L85 PathProgramCache]: Analyzing trace with hash -419521110, now seen corresponding path program 1 times [2024-11-28 05:19:39,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:19:39,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [113574918] [2024-11-28 05:19:39,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:19:39,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:19:39,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:19:39,745 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:19:39,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-28 05:19:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:19:40,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-28 05:19:40,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:19:40,213 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-28 05:19:40,347 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:19:40,347 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-28 05:19:40,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-28 05:19:40,396 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-28 05:19:40,404 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-28 05:19:40,510 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 22 treesize of output 10 [2024-11-28 05:19:40,517 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-28 05:19:41,363 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:19:41,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:19:41,378 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 30 treesize of output 13 [2024-11-28 05:19:41,511 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:19:41,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:19:41,519 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 30 treesize of output 13 [2024-11-28 05:19:41,557 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-28 05:19:41,565 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-28 05:19:41,598 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 05:19:41,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:19:41,801 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2406) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:19:41,835 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2406) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2024-11-28 05:19:43,261 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2498))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2499) .cse0 v_ArrVal_2407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2406) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2499) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2498) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-28 05:19:43,267 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:19:43,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113574918] [2024-11-28 05:19:43,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113574918] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:19:43,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [467114914] [2024-11-28 05:19:43,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:19:43,268 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:19:43,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:19:43,270 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:19:43,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-28 05:19:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:19:46,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-28 05:19:46,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:19:46,313 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-28 05:19:46,437 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-28 05:19:46,451 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:19:46,451 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-28 05:19:46,469 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-28 05:19:46,478 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-28 05:19:46,548 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 22 treesize of output 10 [2024-11-28 05:19:46,554 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-28 05:19:47,395 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:19:47,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:19:47,405 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 30 treesize of output 13 [2024-11-28 05:19:47,484 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:19:47,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:19:47,492 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 30 treesize of output 13 [2024-11-28 05:19:47,525 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-28 05:19:47,532 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-28 05:19:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 05:19:47,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:19:47,584 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2916 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_2916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2915 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2915) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:19:47,613 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2915 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2915) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2916 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2024-11-28 05:19:48,976 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3007 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3007))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3008) .cse0 v_ArrVal_2916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2915) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3007 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3008) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3007) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-28 05:19:48,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [467114914] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:19:48,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:19:48,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-28 05:19:48,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187606011] [2024-11-28 05:19:48,984 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:19:48,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 05:19:48,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:19:48,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 05:19:48,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=110, Unknown=6, NotChecked=150, Total=306 [2024-11-28 05:19:48,991 INFO L87 Difference]: Start difference. First operand 643 states and 712 transitions. Second operand has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:19:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:19:54,543 INFO L93 Difference]: Finished difference Result 642 states and 711 transitions. [2024-11-28 05:19:54,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:19:54,544 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2024-11-28 05:19:54,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:19:54,546 INFO L225 Difference]: With dead ends: 642 [2024-11-28 05:19:54,546 INFO L226 Difference]: Without dead ends: 642 [2024-11-28 05:19:54,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 223 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=219, Unknown=6, NotChecked=210, Total=506 [2024-11-28 05:19:54,547 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 414 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:19:54,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1441 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-28 05:19:54,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-11-28 05:19:54,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2024-11-28 05:19:54,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 461 states have (on average 1.4837310195227766) internal successors, (684), 635 states have internal predecessors, (684), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:19:54,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 711 transitions. [2024-11-28 05:19:54,562 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 711 transitions. Word has length 115 [2024-11-28 05:19:54,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:19:54,563 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 711 transitions. [2024-11-28 05:19:54,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:19:54,563 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 711 transitions. [2024-11-28 05:19:54,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 05:19:54,565 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:19:54,565 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:19:54,585 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-28 05:19:54,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2024-11-28 05:19:54,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 05:19:54,967 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:19:54,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:19:54,967 INFO L85 PathProgramCache]: Analyzing trace with hash 401710501, now seen corresponding path program 1 times [2024-11-28 05:19:54,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:19:54,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [3122495] [2024-11-28 05:19:54,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:19:54,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:19:54,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:19:54,970 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:19:54,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-28 05:19:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:19:55,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-28 05:19:55,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:19:55,484 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-28 05:19:55,645 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:19:55,646 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-28 05:19:55,669 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-28 05:19:56,265 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:19:56,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 05:19:56,361 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:19:56,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 05:19:56,448 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:19:56,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 05:19:56,469 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-28 05:19:56,491 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 05:19:56,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:19:56,585 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3384) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 05:19:56,603 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3383 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3383))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3384)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:19:56,617 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3383 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3383))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3384)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:19:57,066 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2024-11-28 05:19:57,066 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 61 treesize of output 60 [2024-11-28 05:19:57,076 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3383 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3384 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem32#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3430))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3383)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3384)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-28 05:19:57,079 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:19:57,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3122495] [2024-11-28 05:19:57,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3122495] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:19:57,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1214025367] [2024-11-28 05:19:57,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:19:57,080 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:19:57,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:19:57,081 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:19:57,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2024-11-28 05:20:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:02,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-28 05:20:02,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:20:02,606 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-28 05:20:02,607 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 20 [2024-11-28 05:20:02,938 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-28 05:20:02,938 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 26 treesize of output 43 [2024-11-28 05:20:03,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 05:20:03,230 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 34 treesize of output 16 [2024-11-28 05:20:04,564 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:20:04,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2024-11-28 05:20:04,771 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:20:04,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2024-11-28 05:20:04,919 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:20:04,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2024-11-28 05:20:04,959 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 43 treesize of output 19 [2024-11-28 05:20:05,036 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 05:20:05,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:20:05,129 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3806))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3384)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:20:05,140 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3806))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3384)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:20:05,551 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3853 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3853))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3806)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3384)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-28 05:20:05,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1214025367] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:20:05,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:20:05,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 22 [2024-11-28 05:20:05,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715043065] [2024-11-28 05:20:05,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:20:05,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-28 05:20:05,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:20:05,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-28 05:20:05,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=499, Unknown=13, NotChecked=364, Total=992 [2024-11-28 05:20:05,557 INFO L87 Difference]: Start difference. First operand 642 states and 711 transitions. Second operand has 23 states, 20 states have (on average 7.4) internal successors, (148), 22 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:20:13,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:20:13,134 INFO L93 Difference]: Finished difference Result 1155 states and 1284 transitions. [2024-11-28 05:20:13,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-28 05:20:13,134 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.4) internal successors, (148), 22 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 118 [2024-11-28 05:20:13,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:20:13,138 INFO L225 Difference]: With dead ends: 1155 [2024-11-28 05:20:13,139 INFO L226 Difference]: Without dead ends: 1155 [2024-11-28 05:20:13,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 222 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=237, Invalid=1256, Unknown=17, NotChecked=560, Total=2070 [2024-11-28 05:20:13,140 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 1496 mSDsluCounter, 2513 mSDsCounter, 0 mSdLazyCounter, 2968 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 2781 SdHoareTripleChecker+Invalid, 3048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:20:13,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 2781 Invalid, 3048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2968 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2024-11-28 05:20:13,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-11-28 05:20:13,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 641. [2024-11-28 05:20:13,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 461 states have (on average 1.4815618221258136) internal successors, (683), 634 states have internal predecessors, (683), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:20:13,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 710 transitions. [2024-11-28 05:20:13,156 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 710 transitions. Word has length 118 [2024-11-28 05:20:13,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:20:13,157 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 710 transitions. [2024-11-28 05:20:13,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.4) internal successors, (148), 22 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:20:13,157 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 710 transitions. [2024-11-28 05:20:13,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 05:20:13,158 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:20:13,158 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:13,179 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2024-11-28 05:20:13,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-11-28 05:20:13,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:13,559 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:20:13,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:13,560 INFO L85 PathProgramCache]: Analyzing trace with hash 401710502, now seen corresponding path program 1 times [2024-11-28 05:20:13,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:20:13,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1012082471] [2024-11-28 05:20:13,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:13,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:13,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:20:13,562 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:20:13,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-28 05:20:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:14,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-28 05:20:14,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:20:14,117 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-28 05:20:14,250 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:20:14,251 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-28 05:20:14,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-28 05:20:14,285 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-28 05:20:14,293 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-28 05:20:14,400 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 22 treesize of output 10 [2024-11-28 05:20:14,404 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-28 05:20:15,124 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:20:15,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:20:15,134 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 30 treesize of output 13 [2024-11-28 05:20:15,249 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:20:15,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:20:15,261 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 30 treesize of output 13 [2024-11-28 05:20:15,348 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:20:15,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:20:15,357 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 30 treesize of output 13 [2024-11-28 05:20:15,380 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-28 05:20:15,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-28 05:20:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 05:20:15,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:20:15,715 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_4278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2024-11-28 05:20:15,832 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4275) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4276))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4275) .cse2 v_ArrVal_4277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-28 05:20:15,919 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4275) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4276))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4275) .cse3 v_ArrVal_4277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_4278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-28 05:20:17,968 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4369 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4369))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4370) .cse1 v_ArrVal_4275) (select (select (store .cse2 .cse1 v_ArrVal_4276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_4277))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4369 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4369))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_4276))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4370) .cse4 v_ArrVal_4275) .cse5 v_ArrVal_4277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_4278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-28 05:20:17,982 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:20:17,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012082471] [2024-11-28 05:20:17,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012082471] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:20:17,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [590450670] [2024-11-28 05:20:17,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:17,982 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:20:17,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:20:17,985 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:20:17,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2024-11-28 05:20:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:24,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-28 05:20:24,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:20:24,465 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-28 05:20:25,244 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:20:25,244 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-28 05:20:25,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-28 05:20:25,397 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 11 treesize of output 7 [2024-11-28 05:20:25,419 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 15 treesize of output 1 [2024-11-28 05:20:25,794 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 18 treesize of output 10 [2024-11-28 05:20:25,803 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 7 treesize of output 3 [2024-11-28 05:20:27,330 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:20:27,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-28 05:20:27,347 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 24 treesize of output 11 [2024-11-28 05:20:27,703 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:20:27,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-28 05:20:27,720 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 24 treesize of output 11 [2024-11-28 05:20:27,971 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:20:27,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-28 05:20:27,980 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 24 treesize of output 11 [2024-11-28 05:20:28,047 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 25 treesize of output 13 [2024-11-28 05:20:28,055 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 7 treesize of output 3 [2024-11-28 05:20:28,068 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 05:20:28,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:20:28,159 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_4795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:20:28,197 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_4795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-28 05:20:28,341 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4792) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4793) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4793))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4792) .cse2 v_ArrVal_4794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-28 05:20:28,404 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_4793))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4792) .cse1 v_ArrVal_4794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_4795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4792) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_4793) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2024-11-28 05:20:31,005 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4886))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_4793))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4887) .cse0 v_ArrVal_4792) .cse1 v_ArrVal_4794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_4795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_4887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4886))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4887) .cse6 v_ArrVal_4792) (select (select (store .cse7 .cse6 v_ArrVal_4793) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4794))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd (_ bv12 32) .cse5)))))) is different from false [2024-11-28 05:20:31,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [590450670] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:20:31,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:20:31,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2024-11-28 05:20:31,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686285273] [2024-11-28 05:20:31,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:20:31,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 05:20:31,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:20:31,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 05:20:31,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=316, Unknown=18, NotChecked=396, Total=812 [2024-11-28 05:20:31,022 INFO L87 Difference]: Start difference. First operand 641 states and 710 transitions. Second operand has 17 states, 14 states have (on average 9.857142857142858) internal successors, (138), 17 states have internal predecessors, (138), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:20:46,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:20:46,695 INFO L93 Difference]: Finished difference Result 651 states and 721 transitions. [2024-11-28 05:20:46,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:20:46,696 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.857142857142858) internal successors, (138), 17 states have internal predecessors, (138), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 118 [2024-11-28 05:20:46,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:20:46,703 INFO L225 Difference]: With dead ends: 651 [2024-11-28 05:20:46,704 INFO L226 Difference]: Without dead ends: 651 [2024-11-28 05:20:46,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 224 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=136, Invalid=532, Unknown=18, NotChecked=504, Total=1190 [2024-11-28 05:20:46,707 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 755 mSDsluCounter, 1954 mSDsCounter, 0 mSdLazyCounter, 3594 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 2244 SdHoareTripleChecker+Invalid, 3607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:20:46,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 2244 Invalid, 3607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3594 Invalid, 0 Unknown, 0 Unchecked, 15.1s Time] [2024-11-28 05:20:46,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-11-28 05:20:46,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 640. [2024-11-28 05:20:46,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 461 states have (on average 1.4793926247288502) internal successors, (682), 633 states have internal predecessors, (682), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:20:46,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 709 transitions. [2024-11-28 05:20:46,722 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 709 transitions. Word has length 118 [2024-11-28 05:20:46,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:20:46,723 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 709 transitions. [2024-11-28 05:20:46,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.857142857142858) internal successors, (138), 17 states have internal predecessors, (138), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:20:46,723 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 709 transitions. [2024-11-28 05:20:46,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-28 05:20:46,726 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:20:46,726 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:46,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-11-28 05:20:46,939 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2024-11-28 05:20:47,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 05:20:47,127 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:20:47,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:47,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1578952528, now seen corresponding path program 1 times [2024-11-28 05:20:47,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:20:47,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [572228812] [2024-11-28 05:20:47,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:47,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:47,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:20:47,130 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:20:47,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-28 05:20:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:47,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-28 05:20:47,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:20:47,730 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-28 05:20:48,073 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:20:48,073 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-28 05:20:48,113 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-28 05:20:49,298 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:20:49,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 05:20:49,527 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:20:49,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 05:20:49,708 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:20:49,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 05:20:49,893 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:20:49,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 05:20:49,931 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-28 05:20:49,999 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 05:20:49,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:20:50,097 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5270) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-28 05:20:50,115 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2024-11-28 05:20:50,142 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5269))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5270)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2024-11-28 05:20:50,162 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5269))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5270)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:20:50,193 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5268))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5269)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5270)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-28 05:20:50,217 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5268))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5269)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5270)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:20:50,998 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2024-11-28 05:20:50,999 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 109 treesize of output 108 [2024-11-28 05:20:51,021 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5316))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5268)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5269)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5270)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem32#1.base|)) is different from false [2024-11-28 05:20:51,027 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:20:51,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572228812] [2024-11-28 05:20:51,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572228812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:20:51,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1462669692] [2024-11-28 05:20:51,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:51,027 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:20:51,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:20:51,029 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:20:51,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-11-28 05:20:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:58,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-28 05:20:58,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:20:59,058 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-28 05:20:59,060 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 20 [2024-11-28 05:20:59,915 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-28 05:20:59,915 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 26 treesize of output 43 [2024-11-28 05:21:00,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 05:21:00,555 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 34 treesize of output 16 [2024-11-28 05:21:03,861 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:21:03,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2024-11-28 05:21:04,325 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:21:04,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2024-11-28 05:21:04,656 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:21:04,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2024-11-28 05:21:05,011 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:21:05,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2024-11-28 05:21:05,105 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 43 treesize of output 19 [2024-11-28 05:21:05,276 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 05:21:05,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:21:05,308 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5700 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5700) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-28 05:21:05,324 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5700 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5700) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 05:21:05,349 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5700 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5699 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5699))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5700)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:21:05,367 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5700 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5699 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5699))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5700)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:21:05,395 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5700 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5698 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5699 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5698))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5699)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5700)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:21:05,417 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5700 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5698 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5699 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5698))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5699)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5700)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:21:06,116 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5700 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5746 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5698 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5699 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5746))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5698)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5699)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5700)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:21:06,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1462669692] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:21:06,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:21:06,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 24 [2024-11-28 05:21:06,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953581804] [2024-11-28 05:21:06,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:21:06,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-28 05:21:06,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:21:06,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-28 05:21:06,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=551, Unknown=14, NotChecked=854, Total=1560 [2024-11-28 05:21:06,125 INFO L87 Difference]: Start difference. First operand 640 states and 709 transitions. Second operand has 25 states, 22 states have (on average 7.0) internal successors, (154), 24 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:21:25,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:25,811 INFO L93 Difference]: Finished difference Result 1151 states and 1280 transitions. [2024-11-28 05:21:25,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-28 05:21:25,812 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.0) internal successors, (154), 24 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 121 [2024-11-28 05:21:25,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:25,817 INFO L225 Difference]: With dead ends: 1151 [2024-11-28 05:21:25,817 INFO L226 Difference]: Without dead ends: 1151 [2024-11-28 05:21:25,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=273, Invalid=1409, Unknown=14, NotChecked=1274, Total=2970 [2024-11-28 05:21:25,818 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 1472 mSDsluCounter, 3715 mSDsCounter, 0 mSdLazyCounter, 4234 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 3982 SdHoareTripleChecker+Invalid, 4314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 4234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:25,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 3982 Invalid, 4314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 4234 Invalid, 0 Unknown, 0 Unchecked, 18.5s Time] [2024-11-28 05:21:25,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2024-11-28 05:21:25,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 639. [2024-11-28 05:21:25,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 461 states have (on average 1.4772234273318872) internal successors, (681), 632 states have internal predecessors, (681), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:21:25,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 708 transitions. [2024-11-28 05:21:25,833 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 708 transitions. Word has length 121 [2024-11-28 05:21:25,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:25,834 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 708 transitions. [2024-11-28 05:21:25,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.0) internal successors, (154), 24 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:21:25,834 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 708 transitions. [2024-11-28 05:21:25,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-28 05:21:25,835 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:25,835 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:21:25,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2024-11-28 05:21:26,048 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-28 05:21:26,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:26,236 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:21:26,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:26,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1578952529, now seen corresponding path program 1 times [2024-11-28 05:21:26,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:21:26,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1821420232] [2024-11-28 05:21:26,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:26,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:26,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:21:26,239 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:21:26,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-28 05:21:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:26,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-28 05:21:26,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:26,890 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-28 05:21:27,210 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-28 05:21:27,251 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:21:27,251 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-28 05:21:27,309 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-28 05:21:27,327 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-28 05:21:27,557 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 22 treesize of output 10 [2024-11-28 05:21:27,566 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-28 05:21:29,213 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:21:29,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:21:29,230 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 30 treesize of output 13 [2024-11-28 05:21:29,457 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:21:29,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:21:29,481 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 30 treesize of output 13 [2024-11-28 05:21:29,678 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:21:29,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:21:29,694 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 30 treesize of output 13 [2024-11-28 05:21:29,903 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:21:29,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:21:29,919 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 30 treesize of output 13 [2024-11-28 05:21:29,974 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-28 05:21:29,989 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-28 05:21:30,059 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 05:21:30,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:21:30,332 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6179 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6178) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6178 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6178) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv20 32) .cse1) (bvadd (_ bv24 32) .cse1)))))) is different from false [2024-11-28 05:21:30,371 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6179 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6178) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6178 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6178) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd (_ bv24 32) .cse2))))))) is different from false [2024-11-28 05:21:30,877 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6176 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6178 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6176) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6178) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_6176 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6177))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6176) .cse3 v_ArrVal_6178) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_6179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-28 05:21:31,258 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6175 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6176 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6174))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_6177))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6175) .cse0 v_ArrVal_6176) .cse1 v_ArrVal_6178) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_6174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6175 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6176 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6178 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6174))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6175) .cse6 v_ArrVal_6176) (select (select (store .cse7 .cse6 v_ArrVal_6177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6178))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2024-11-28 05:21:31,902 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_6174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6175 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6176 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6178 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6174))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6175) .cse2 v_ArrVal_6176) (select (select (store .cse3 .cse2 v_ArrVal_6177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_6178))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_6174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6175 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6176 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6174))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_6177))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6175) .cse5 v_ArrVal_6176) .cse6 v_ArrVal_6178) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_6179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2024-11-28 05:21:38,550 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6175 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6176 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6270))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_6174))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_6177))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6271) .cse0 v_ArrVal_6175) .cse1 v_ArrVal_6176) .cse2 v_ArrVal_6178) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_6179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_6271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6175 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6176 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6178 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6270))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_6174))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6271) .cse8 v_ArrVal_6175) .cse9 v_ArrVal_6176) (select (select (store .cse10 .cse9 v_ArrVal_6177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6178))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse7) (bvadd (_ bv24 32) .cse7)))))) is different from false [2024-11-28 05:21:38,603 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:21:38,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821420232] [2024-11-28 05:21:38,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821420232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:21:38,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1242513703] [2024-11-28 05:21:38,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:38,603 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:21:38,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:21:38,605 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:21:38,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2024-11-28 05:21:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:47,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 121 conjuncts are in the unsatisfiable core [2024-11-28 05:21:47,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:47,750 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-28 05:21:54,737 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:21:54,737 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-28 05:21:54,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-28 05:21:55,955 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 11 treesize of output 7 [2024-11-28 05:21:56,135 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 15 treesize of output 1 [2024-11-28 05:21:59,358 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 18 treesize of output 10 [2024-11-28 05:21:59,418 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 7 treesize of output 3 [2024-11-28 05:22:12,234 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:22:12,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-28 05:22:12,316 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 24 treesize of output 11 [2024-11-28 05:22:15,753 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:22:15,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-28 05:22:15,832 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 24 treesize of output 11 [2024-11-28 05:22:18,778 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:22:18,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-28 05:22:18,858 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 24 treesize of output 11 [2024-11-28 05:22:21,586 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:22:21,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-28 05:22:21,809 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 24 treesize of output 11 [2024-11-28 05:22:22,305 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 25 treesize of output 13 [2024-11-28 05:22:22,446 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 7 treesize of output 3 [2024-11-28 05:22:22,515 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 05:22:22,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:22:23,197 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_6703 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6703) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:22:23,455 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6703 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6703) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd (_ bv24 32) .cse2))))))) is different from false [2024-11-28 05:22:23,919 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6702) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6701) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_6701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6703 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6701))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6702) .cse2 v_ArrVal_6704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6703) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-28 05:22:24,191 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6702) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6701) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_6701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6703 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6701))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6702) .cse3 v_ArrVal_6704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_6703) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-28 05:22:24,635 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6699 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6700 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6699))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6700) .cse1 v_ArrVal_6702) (select (select (store .cse2 .cse1 v_ArrVal_6701) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6704))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_6701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6703 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6699 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6700 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6699))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_6701))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6700) .cse4 v_ArrVal_6702) .cse5 v_ArrVal_6704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_6703) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-28 05:22:24,947 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_6701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6703 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6699 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6700 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6699))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_6701))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6700) .cse1 v_ArrVal_6702) .cse2 v_ArrVal_6704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_6703) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_6701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6699 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6700 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6699))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6700) .cse7 v_ArrVal_6702) (select (select (store .cse8 .cse7 v_ArrVal_6701) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6704))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd (_ bv24 32) .cse6))))))) is different from false [2024-11-28 05:22:32,744 WARN L286 SmtUtils]: Spent 7.60s on a formula simplification that was a NOOP. DAG size: 356 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-28 05:22:34,155 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6699 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6700 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6795 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6795))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_6699))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6796) .cse1 v_ArrVal_6700) .cse2 v_ArrVal_6702) (select (select (store .cse3 .cse2 v_ArrVal_6701) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_6704))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_6701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6703 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6699 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6700 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6795 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6795))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_6699))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_6701))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6796) .cse6 v_ArrVal_6700) .cse7 v_ArrVal_6702) .cse8 v_ArrVal_6704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_6703) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2024-11-28 05:22:34,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1242513703] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:22:34,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:22:34,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2024-11-28 05:22:34,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032432899] [2024-11-28 05:22:34,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:22:34,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 05:22:34,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:22:34,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 05:22:34,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=392, Unknown=22, NotChecked=676, Total=1190 [2024-11-28 05:22:34,230 INFO L87 Difference]: Start difference. First operand 639 states and 708 transitions. Second operand has 19 states, 16 states have (on average 9.0) internal successors, (144), 19 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:24:09,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:09,859 INFO L93 Difference]: Finished difference Result 649 states and 719 transitions. [2024-11-28 05:24:09,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 05:24:09,860 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.0) internal successors, (144), 19 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 121 [2024-11-28 05:24:09,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:09,861 INFO L225 Difference]: With dead ends: 649 [2024-11-28 05:24:09,861 INFO L226 Difference]: Without dead ends: 649 [2024-11-28 05:24:09,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=164, Invalid=678, Unknown=22, NotChecked=858, Total=1722 [2024-11-28 05:24:09,862 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 756 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 2948 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 89.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 2963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 90.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:09,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 1885 Invalid, 2963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2948 Invalid, 0 Unknown, 0 Unchecked, 90.7s Time] [2024-11-28 05:24:09,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-28 05:24:09,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 638. [2024-11-28 05:24:09,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 461 states have (on average 1.475054229934924) internal successors, (680), 631 states have internal predecessors, (680), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:24:09,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 707 transitions. [2024-11-28 05:24:09,874 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 707 transitions. Word has length 121 [2024-11-28 05:24:09,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:09,874 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 707 transitions. [2024-11-28 05:24:09,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.0) internal successors, (144), 19 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:24:09,875 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 707 transitions. [2024-11-28 05:24:09,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-28 05:24:09,876 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:09,876 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:24:09,898 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2024-11-28 05:24:10,092 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2024-11-28 05:24:10,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 05:24:10,277 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 05:24:10,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:10,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1404319278, now seen corresponding path program 1 times [2024-11-28 05:24:10,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:24:10,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1255044901] [2024-11-28 05:24:10,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:10,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:24:10,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:24:10,281 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:24:10,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-11-28 05:24:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:10,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-28 05:24:10,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:24:11,027 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-28 05:24:14,309 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:24:14,309 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-28 05:24:14,670 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-28 05:24:24,124 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:24:24,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 05:24:25,953 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:24:25,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 05:24:27,396 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:24:27,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 05:24:28,909 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:24:28,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 05:24:30,485 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:24:30,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 05:24:30,780 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-28 05:24:32,058 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-28 05:24:32,058 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-28 05:24:32,118 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 05:24:32,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:24:34,934 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7188) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 05:24:35,129 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7187))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7188)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:24:35,265 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7187))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7188)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-28 05:24:35,486 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7186))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7187)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7188)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:24:35,625 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7186))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7187)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7188)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:24:35,831 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7185))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7186)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7187)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7188)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:24:35,975 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7185))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7186)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7187)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7188)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:24:39,987 INFO L349 Elim1Store]: treesize reduction 7, result has 96.5 percent of original size [2024-11-28 05:24:39,987 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 205 treesize of output 204 [2024-11-28 05:24:40,109 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem32#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7235))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7185)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7186)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7187)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7188)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-28 05:24:40,142 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:24:40,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255044901] [2024-11-28 05:24:40,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255044901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:24:40,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [459841705] [2024-11-28 05:24:40,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:40,142 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:24:40,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:24:40,144 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:24:40,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a653f442-8995-4acb-a945-3913ebaf1a01/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2024-11-28 05:24:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:46,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-28 05:24:46,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:24:47,988 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-28 05:24:47,988 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 20 [2024-11-28 05:24:55,623 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-28 05:24:55,623 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 26 treesize of output 43 [2024-11-28 05:24:57,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 05:25:00,895 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 34 treesize of output 16