./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e24809269f51bce916d93021d3fd241dd9f82f81ed2d62c2bdb32d3cd025077 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:42:36,435 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:42:36,531 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:42:36,536 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:42:36,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:42:36,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:42:36,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:42:36,580 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:42:36,580 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:42:36,581 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:42:36,581 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:42:36,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:42:36,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:42:36,582 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:42:36,584 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:42:36,586 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:42:36,587 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:42:36,587 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:42:36,591 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:42:36,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:42:36,592 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:42:36,592 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:42:36,592 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:42:36,592 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:42:36,593 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:42:36,593 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:42:36,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:42:36,593 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:42:36,594 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:42:36,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:42:36,594 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:42:36,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:42:36,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:42:36,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:42:36,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:42:36,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:42:36,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:42:36,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:42:36,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:42:36,600 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:42:36,600 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:42:36,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:42:36,600 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e24809269f51bce916d93021d3fd241dd9f82f81ed2d62c2bdb32d3cd025077 [2024-11-08 16:42:36,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:42:36,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:42:36,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:42:36,940 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:42:36,940 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:42:36,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i Unable to find full path for "g++" [2024-11-08 16:42:38,991 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:42:39,265 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:42:39,265 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i [2024-11-08 16:42:39,281 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/data/8f4698356/6ddf3dcc310d49c98b42601e82997594/FLAG3b6497aab [2024-11-08 16:42:39,303 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/data/8f4698356/6ddf3dcc310d49c98b42601e82997594 [2024-11-08 16:42:39,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:42:39,308 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:42:39,309 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:42:39,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:42:39,318 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:42:39,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:42:39" (1/1) ... [2024-11-08 16:42:39,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@664c3ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:39, skipping insertion in model container [2024-11-08 16:42:39,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:42:39" (1/1) ... [2024-11-08 16:42:39,362 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:42:39,664 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i[916,929] [2024-11-08 16:42:39,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:42:39,748 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:42:39,767 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i[916,929] [2024-11-08 16:42:39,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:42:39,854 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:42:39,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:39 WrapperNode [2024-11-08 16:42:39,854 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:42:39,855 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:42:39,855 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:42:39,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:42:39,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:39" (1/1) ... [2024-11-08 16:42:39,882 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:39" (1/1) ... [2024-11-08 16:42:39,927 INFO L138 Inliner]: procedures = 29, calls = 177, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 527 [2024-11-08 16:42:39,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:42:39,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:42:39,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:42:39,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:42:39,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:39" (1/1) ... [2024-11-08 16:42:39,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:39" (1/1) ... [2024-11-08 16:42:39,952 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:39" (1/1) ... [2024-11-08 16:42:39,994 INFO L175 MemorySlicer]: Split 133 memory accesses to 16 slices as follows [2, 3, 12, 12, 6, 5, 10, 7, 10, 10, 12, 17, 6, 10, 5, 6]. 13 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 2, 1]. [2024-11-08 16:42:39,994 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:39" (1/1) ... [2024-11-08 16:42:39,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:39" (1/1) ... [2024-11-08 16:42:40,028 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:39" (1/1) ... [2024-11-08 16:42:40,041 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:39" (1/1) ... [2024-11-08 16:42:40,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:39" (1/1) ... [2024-11-08 16:42:40,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:39" (1/1) ... [2024-11-08 16:42:40,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:42:40,073 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:42:40,074 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:42:40,074 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:42:40,075 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:39" (1/1) ... [2024-11-08 16:42:40,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:42:40,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:42:40,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:42:40,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:42:40,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:42:40,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-08 16:42:40,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-08 16:42:40,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-08 16:42:40,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-08 16:42:40,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-08 16:42:40,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-08 16:42:40,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-08 16:42:40,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-08 16:42:40,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-08 16:42:40,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-08 16:42:40,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-08 16:42:40,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-08 16:42:40,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-08 16:42:40,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-11-08 16:42:40,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-11-08 16:42:40,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-11-08 16:42:40,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 16:42:40,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 16:42:40,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 16:42:40,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 16:42:40,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-08 16:42:40,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-08 16:42:40,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-08 16:42:40,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-08 16:42:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-08 16:42:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-08 16:42:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-08 16:42:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-08 16:42:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-08 16:42:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-08 16:42:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-08 16:42:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-11-08 16:42:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-08 16:42:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-08 16:42:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-08 16:42:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-08 16:42:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-08 16:42:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-08 16:42:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-08 16:42:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-08 16:42:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-08 16:42:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-08 16:42:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-08 16:42:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-08 16:42:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-08 16:42:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-11-08 16:42:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-11-08 16:42:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-11-08 16:42:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 16:42:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 16:42:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 16:42:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 16:42:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-08 16:42:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-08 16:42:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-08 16:42:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-08 16:42:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-08 16:42:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-08 16:42:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-08 16:42:40,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-08 16:42:40,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-08 16:42:40,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-08 16:42:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-08 16:42:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-11-08 16:42:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-08 16:42:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-08 16:42:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-08 16:42:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-08 16:42:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-08 16:42:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-08 16:42:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-08 16:42:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-08 16:42:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-08 16:42:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-08 16:42:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-08 16:42:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-08 16:42:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-08 16:42:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-11-08 16:42:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-11-08 16:42:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-11-08 16:42:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:42:40,175 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:42:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:42:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 16:42:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 16:42:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 16:42:40,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 16:42:40,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-08 16:42:40,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-08 16:42:40,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-08 16:42:40,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-08 16:42:40,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-08 16:42:40,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-08 16:42:40,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-08 16:42:40,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-08 16:42:40,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-08 16:42:40,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-08 16:42:40,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-08 16:42:40,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:42:40,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:42:40,438 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:42:40,441 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:42:41,158 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-11-08 16:42:41,158 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:42:41,180 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:42:41,180 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:42:41,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:42:41 BoogieIcfgContainer [2024-11-08 16:42:41,181 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:42:41,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:42:41,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:42:41,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:42:41,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:42:39" (1/3) ... [2024-11-08 16:42:41,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c12f719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:42:41, skipping insertion in model container [2024-11-08 16:42:41,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:42:39" (2/3) ... [2024-11-08 16:42:41,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c12f719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:42:41, skipping insertion in model container [2024-11-08 16:42:41,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:42:41" (3/3) ... [2024-11-08 16:42:41,189 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-53.i [2024-11-08 16:42:41,204 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:42:41,205 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:42:41,278 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:42:41,286 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@251b4ca1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:42:41,287 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:42:41,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 92 states have internal predecessors, (128), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:42:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 16:42:41,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:41,309 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:41,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:41,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:41,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1912926115, now seen corresponding path program 1 times [2024-11-08 16:42:41,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:41,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161145484] [2024-11-08 16:42:41,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:41,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:42:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:42:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:42:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:42:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:42:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:42:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:42:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:42:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:42:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:42:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:42:41,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:41,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161145484] [2024-11-08 16:42:41,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161145484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:41,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:41,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:42:41,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160364973] [2024-11-08 16:42:41,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:41,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:42:41,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:42,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:42:42,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:42:42,018 INFO L87 Difference]: Start difference. First operand has 112 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 92 states have internal predecessors, (128), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 16:42:42,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:42,073 INFO L93 Difference]: Finished difference Result 217 states and 340 transitions. [2024-11-08 16:42:42,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:42:42,078 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2024-11-08 16:42:42,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:42,092 INFO L225 Difference]: With dead ends: 217 [2024-11-08 16:42:42,092 INFO L226 Difference]: Without dead ends: 108 [2024-11-08 16:42:42,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-08 16:42:42,100 INFO L432 NwaCegarLoop]: 155 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, 155 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-08 16:42:42,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:42:42,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-08 16:42:42,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-08 16:42:42,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:42:42,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2024-11-08 16:42:42,167 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 140 [2024-11-08 16:42:42,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:42,170 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2024-11-08 16:42:42,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 16:42:42,171 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2024-11-08 16:42:42,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 16:42:42,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:42,179 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:42,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:42:42,179 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:42,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:42,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1070900733, now seen corresponding path program 1 times [2024-11-08 16:42:42,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:42,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039926247] [2024-11-08 16:42:42,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:42,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:42,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:42,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:42,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:42:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:42,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:42:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:42,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:42,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:42:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:42,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:42:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:42,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:42,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:42:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:42,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:42,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:42,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:42,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:42,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:42:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:42,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:42:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:42,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:42:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:42,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:42:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:42,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:42:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:42,867 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:42:42,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:42,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039926247] [2024-11-08 16:42:42,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039926247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:42,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:42,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:42:42,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908740547] [2024-11-08 16:42:42,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:42,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:42:42,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:42,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:42:42,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:42:42,877 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 16:42:42,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:42,952 INFO L93 Difference]: Finished difference Result 215 states and 310 transitions. [2024-11-08 16:42:42,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:42:42,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2024-11-08 16:42:42,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:42,957 INFO L225 Difference]: With dead ends: 215 [2024-11-08 16:42:42,957 INFO L226 Difference]: Without dead ends: 110 [2024-11-08 16:42:42,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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-08 16:42:42,960 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:42,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:42:42,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-08 16:42:42,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-08 16:42:42,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:42:42,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 157 transitions. [2024-11-08 16:42:42,975 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 157 transitions. Word has length 140 [2024-11-08 16:42:42,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:42,977 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 157 transitions. [2024-11-08 16:42:42,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 16:42:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 157 transitions. [2024-11-08 16:42:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 16:42:42,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:42,981 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:42,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:42:42,982 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:42,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:42,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1909934395, now seen corresponding path program 1 times [2024-11-08 16:42:42,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:42,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587996709] [2024-11-08 16:42:42,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:42,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:42:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:42:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:42:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:42:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:42:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:42:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:42:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:42:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:42:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:42:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,596 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:42:43,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:43,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587996709] [2024-11-08 16:42:43,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587996709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:43,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:43,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:42:43,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598506295] [2024-11-08 16:42:43,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:43,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:42:43,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:43,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:42:43,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:42:43,603 INFO L87 Difference]: Start difference. First operand 110 states and 157 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:42:43,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:43,633 INFO L93 Difference]: Finished difference Result 217 states and 311 transitions. [2024-11-08 16:42:43,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:42:43,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-11-08 16:42:43,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:43,640 INFO L225 Difference]: With dead ends: 217 [2024-11-08 16:42:43,641 INFO L226 Difference]: Without dead ends: 110 [2024-11-08 16:42:43,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-08 16:42:43,647 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:43,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:42:43,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-08 16:42:43,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-08 16:42:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:42:43,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2024-11-08 16:42:43,671 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 140 [2024-11-08 16:42:43,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:43,675 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2024-11-08 16:42:43,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:42:43,676 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2024-11-08 16:42:43,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 16:42:43,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:43,682 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:43,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:42:43,682 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:43,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:43,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1363964547, now seen corresponding path program 1 times [2024-11-08 16:42:43,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:43,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268781373] [2024-11-08 16:42:43,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:43,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:42:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:42:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:42:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:42:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:42:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:42:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:42:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:42:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:42:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:42:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:45,398 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:42:45,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:45,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268781373] [2024-11-08 16:42:45,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268781373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:45,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:45,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:42:45,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010383084] [2024-11-08 16:42:45,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:45,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:42:45,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:45,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:42:45,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:42:45,405 INFO L87 Difference]: Start difference. First operand 110 states and 156 transitions. Second operand has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-08 16:42:45,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:45,870 INFO L93 Difference]: Finished difference Result 223 states and 315 transitions. [2024-11-08 16:42:45,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:42:45,872 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 140 [2024-11-08 16:42:45,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:45,874 INFO L225 Difference]: With dead ends: 223 [2024-11-08 16:42:45,874 INFO L226 Difference]: Without dead ends: 116 [2024-11-08 16:42:45,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:42:45,880 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 216 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:45,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 546 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:42:45,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-08 16:42:45,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-08 16:42:45,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 95 states have (on average 1.3157894736842106) internal successors, (125), 95 states have internal predecessors, (125), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:42:45,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 161 transitions. [2024-11-08 16:42:45,917 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 161 transitions. Word has length 140 [2024-11-08 16:42:45,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:45,917 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 161 transitions. [2024-11-08 16:42:45,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-08 16:42:45,918 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 161 transitions. [2024-11-08 16:42:45,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 16:42:45,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:45,924 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:45,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:42:45,924 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:45,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:45,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2065029125, now seen corresponding path program 1 times [2024-11-08 16:42:45,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:45,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901337028] [2024-11-08 16:42:45,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:45,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:48,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:48,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:48,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:42:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:48,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:42:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:48,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:48,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:42:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:48,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:42:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:48,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:48,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:42:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:48,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:48,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:48,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:48,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:48,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:42:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:48,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:42:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:48,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:42:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:48,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:42:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:48,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:42:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:48,837 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:42:48,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:48,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901337028] [2024-11-08 16:42:48,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901337028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:48,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:48,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:42:48,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760760190] [2024-11-08 16:42:48,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:48,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:42:48,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:48,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:42:48,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:42:48,842 INFO L87 Difference]: Start difference. First operand 116 states and 161 transitions. Second operand has 11 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 16:42:49,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:49,615 INFO L93 Difference]: Finished difference Result 343 states and 478 transitions. [2024-11-08 16:42:49,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:42:49,616 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 140 [2024-11-08 16:42:49,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:49,622 INFO L225 Difference]: With dead ends: 343 [2024-11-08 16:42:49,623 INFO L226 Difference]: Without dead ends: 230 [2024-11-08 16:42:49,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-08 16:42:49,624 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 320 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:49,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1067 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 16:42:49,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-08 16:42:49,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 223. [2024-11-08 16:42:49,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 182 states have (on average 1.3186813186813187) internal successors, (240), 182 states have internal predecessors, (240), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:42:49,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 312 transitions. [2024-11-08 16:42:49,674 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 312 transitions. Word has length 140 [2024-11-08 16:42:49,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:49,675 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 312 transitions. [2024-11-08 16:42:49,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 16:42:49,676 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 312 transitions. [2024-11-08 16:42:49,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 16:42:49,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:49,678 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:49,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:42:49,679 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:49,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:49,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1446317204, now seen corresponding path program 1 times [2024-11-08 16:42:49,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:49,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147707889] [2024-11-08 16:42:49,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:49,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:42:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:42:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:42:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:42:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:42:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:42:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:42:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:42:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:42:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:42:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:42:51,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:51,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147707889] [2024-11-08 16:42:51,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147707889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:51,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:51,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:42:51,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767743057] [2024-11-08 16:42:51,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:51,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:42:51,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:51,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:42:51,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:42:51,264 INFO L87 Difference]: Start difference. First operand 223 states and 312 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:42:51,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:51,670 INFO L93 Difference]: Finished difference Result 336 states and 469 transitions. [2024-11-08 16:42:51,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:42:51,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2024-11-08 16:42:51,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:51,673 INFO L225 Difference]: With dead ends: 336 [2024-11-08 16:42:51,674 INFO L226 Difference]: Without dead ends: 223 [2024-11-08 16:42:51,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:42:51,677 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 144 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:51,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 539 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:42:51,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-08 16:42:51,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 114. [2024-11-08 16:42:51,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3010752688172043) internal successors, (121), 93 states have internal predecessors, (121), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:42:51,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 157 transitions. [2024-11-08 16:42:51,719 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 157 transitions. Word has length 142 [2024-11-08 16:42:51,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:51,721 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 157 transitions. [2024-11-08 16:42:51,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:42:51,721 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 157 transitions. [2024-11-08 16:42:51,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:42:51,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:51,725 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:51,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:42:51,725 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:51,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:51,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1671163586, now seen corresponding path program 1 times [2024-11-08 16:42:51,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:51,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128763327] [2024-11-08 16:42:51,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:51,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:52,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:52,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:52,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:42:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:52,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:42:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:52,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:52,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:42:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:52,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:42:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:52,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:52,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:42:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:52,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:52,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:52,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:52,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:52,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:42:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:52,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:42:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:52,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:42:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:52,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:42:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:52,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:42:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:42:52,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:52,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128763327] [2024-11-08 16:42:52,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128763327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:52,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:52,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:42:52,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336775123] [2024-11-08 16:42:52,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:52,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:42:52,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:52,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:42:52,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:42:52,217 INFO L87 Difference]: Start difference. First operand 114 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:42:52,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:52,273 INFO L93 Difference]: Finished difference Result 225 states and 311 transitions. [2024-11-08 16:42:52,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:42:52,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-08 16:42:52,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:52,275 INFO L225 Difference]: With dead ends: 225 [2024-11-08 16:42:52,276 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 16:42:52,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 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-08 16:42:52,277 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:52,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:42:52,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 16:42:52,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-08 16:42:52,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:42:52,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 156 transitions. [2024-11-08 16:42:52,296 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 156 transitions. Word has length 145 [2024-11-08 16:42:52,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:52,297 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 156 transitions. [2024-11-08 16:42:52,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:42:52,298 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 156 transitions. [2024-11-08 16:42:52,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:42:52,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:52,300 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:52,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:42:52,300 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:52,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:52,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1084357572, now seen corresponding path program 1 times [2024-11-08 16:42:52,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:52,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817542890] [2024-11-08 16:42:52,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:52,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:42:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:42:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:42:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:42:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:42:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:42:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:42:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:42:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:42:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:42:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:42:53,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:53,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817542890] [2024-11-08 16:42:53,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817542890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:53,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:53,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:42:53,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626177197] [2024-11-08 16:42:53,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:53,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:42:53,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:53,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:42:53,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:42:53,571 INFO L87 Difference]: Start difference. First operand 114 states and 156 transitions. Second operand has 10 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-08 16:42:54,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:54,320 INFO L93 Difference]: Finished difference Result 305 states and 415 transitions. [2024-11-08 16:42:54,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:42:54,321 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 145 [2024-11-08 16:42:54,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:54,323 INFO L225 Difference]: With dead ends: 305 [2024-11-08 16:42:54,323 INFO L226 Difference]: Without dead ends: 194 [2024-11-08 16:42:54,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:42:54,324 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 345 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:54,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1148 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:42:54,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-08 16:42:54,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2024-11-08 16:42:54,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 158 states have (on average 1.2848101265822784) internal successors, (203), 159 states have internal predecessors, (203), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 16:42:54,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 259 transitions. [2024-11-08 16:42:54,372 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 259 transitions. Word has length 145 [2024-11-08 16:42:54,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:54,372 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 259 transitions. [2024-11-08 16:42:54,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-08 16:42:54,373 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 259 transitions. [2024-11-08 16:42:54,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:42:54,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:54,375 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:54,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:42:54,375 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:54,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:54,376 INFO L85 PathProgramCache]: Analyzing trace with hash -22363421, now seen corresponding path program 1 times [2024-11-08 16:42:54,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:54,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750837796] [2024-11-08 16:42:54,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:54,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:55,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:55,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:55,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:42:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:55,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:42:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:55,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:55,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:42:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:55,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:42:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:55,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:55,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:42:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:55,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:55,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:55,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:55,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:55,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:42:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:55,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:42:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:55,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:42:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:55,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:42:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:55,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:42:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:42:55,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:55,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750837796] [2024-11-08 16:42:55,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750837796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:55,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:55,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:42:55,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126948833] [2024-11-08 16:42:55,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:55,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:42:55,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:55,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:42:55,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:42:55,659 INFO L87 Difference]: Start difference. First operand 191 states and 259 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:42:56,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:56,327 INFO L93 Difference]: Finished difference Result 619 states and 841 transitions. [2024-11-08 16:42:56,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:42:56,328 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2024-11-08 16:42:56,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:56,333 INFO L225 Difference]: With dead ends: 619 [2024-11-08 16:42:56,335 INFO L226 Difference]: Without dead ends: 431 [2024-11-08 16:42:56,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:42:56,336 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 162 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:56,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1157 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:42:56,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-08 16:42:56,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 424. [2024-11-08 16:42:56,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 356 states have (on average 1.300561797752809) internal successors, (463), 359 states have internal predecessors, (463), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-08 16:42:56,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 579 transitions. [2024-11-08 16:42:56,433 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 579 transitions. Word has length 146 [2024-11-08 16:42:56,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:56,434 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 579 transitions. [2024-11-08 16:42:56,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:42:56,434 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 579 transitions. [2024-11-08 16:42:56,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:42:56,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:56,436 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:56,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 16:42:56,437 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:56,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:56,437 INFO L85 PathProgramCache]: Analyzing trace with hash 678701157, now seen corresponding path program 1 times [2024-11-08 16:42:56,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:56,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343098727] [2024-11-08 16:42:56,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:56,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:57,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:57,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:57,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:42:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:57,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:42:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:57,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:57,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:42:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:57,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:42:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:42:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:42:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:42:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:42:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:42:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:42:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:42:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:42:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:42:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:42:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:42:58,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:58,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343098727] [2024-11-08 16:42:58,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343098727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:58,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:58,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 16:42:58,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184478990] [2024-11-08 16:42:58,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:58,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 16:42:58,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:58,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 16:42:58,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:42:58,061 INFO L87 Difference]: Start difference. First operand 424 states and 579 transitions. Second operand has 13 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 16:42:59,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:59,145 INFO L93 Difference]: Finished difference Result 890 states and 1211 transitions. [2024-11-08 16:42:59,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 16:42:59,146 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 146 [2024-11-08 16:42:59,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:59,149 INFO L225 Difference]: With dead ends: 890 [2024-11-08 16:42:59,149 INFO L226 Difference]: Without dead ends: 469 [2024-11-08 16:42:59,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2024-11-08 16:42:59,155 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 320 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:59,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1157 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 16:42:59,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-11-08 16:42:59,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 431. [2024-11-08 16:42:59,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 363 states have (on average 1.2947658402203857) internal successors, (470), 366 states have internal predecessors, (470), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-08 16:42:59,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 586 transitions. [2024-11-08 16:42:59,245 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 586 transitions. Word has length 146 [2024-11-08 16:42:59,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:59,249 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 586 transitions. [2024-11-08 16:42:59,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 16:42:59,249 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 586 transitions. [2024-11-08 16:42:59,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:42:59,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:59,252 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:59,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 16:42:59,252 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:59,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:59,253 INFO L85 PathProgramCache]: Analyzing trace with hash -840011871, now seen corresponding path program 1 times [2024-11-08 16:42:59,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:59,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315034468] [2024-11-08 16:42:59,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:59,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:43:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:43:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:43:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:43:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:43:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:43:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:43:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:43:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:43:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:43:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:00,113 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:43:00,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:00,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315034468] [2024-11-08 16:43:00,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315034468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:00,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:00,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:43:00,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251974658] [2024-11-08 16:43:00,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:00,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:43:00,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:00,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:43:00,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:43:00,117 INFO L87 Difference]: Start difference. First operand 431 states and 586 transitions. Second operand has 9 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 16:43:00,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:00,613 INFO L93 Difference]: Finished difference Result 971 states and 1320 transitions. [2024-11-08 16:43:00,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:43:00,614 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 146 [2024-11-08 16:43:00,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:00,617 INFO L225 Difference]: With dead ends: 971 [2024-11-08 16:43:00,617 INFO L226 Difference]: Without dead ends: 543 [2024-11-08 16:43:00,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:43:00,619 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 211 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:00,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 849 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:43:00,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-08 16:43:00,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 451. [2024-11-08 16:43:00,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 383 states have (on average 1.287206266318538) internal successors, (493), 386 states have internal predecessors, (493), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-08 16:43:00,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 609 transitions. [2024-11-08 16:43:00,693 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 609 transitions. Word has length 146 [2024-11-08 16:43:00,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:00,693 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 609 transitions. [2024-11-08 16:43:00,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 16:43:00,694 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 609 transitions. [2024-11-08 16:43:00,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:43:00,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:00,696 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:00,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 16:43:00,697 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:00,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:00,697 INFO L85 PathProgramCache]: Analyzing trace with hash -138947293, now seen corresponding path program 1 times [2024-11-08 16:43:00,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:00,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392646393] [2024-11-08 16:43:00,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:00,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:02,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:02,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:02,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:43:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:02,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:43:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:02,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:02,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:43:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:02,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:43:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:02,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:02,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:43:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:02,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:02,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:02,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:02,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:02,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:43:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:02,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:43:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:02,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:43:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:02,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:43:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:02,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:43:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:02,134 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:43:02,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:02,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392646393] [2024-11-08 16:43:02,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392646393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:02,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:02,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 16:43:02,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081264957] [2024-11-08 16:43:02,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:02,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:43:02,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:02,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:43:02,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:43:02,137 INFO L87 Difference]: Start difference. First operand 451 states and 609 transitions. Second operand has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 16:43:03,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:03,048 INFO L93 Difference]: Finished difference Result 907 states and 1221 transitions. [2024-11-08 16:43:03,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 16:43:03,049 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 146 [2024-11-08 16:43:03,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:03,052 INFO L225 Difference]: With dead ends: 907 [2024-11-08 16:43:03,052 INFO L226 Difference]: Without dead ends: 459 [2024-11-08 16:43:03,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2024-11-08 16:43:03,055 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 277 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:03,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1414 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 16:43:03,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-08 16:43:03,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 451. [2024-11-08 16:43:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 383 states have (on average 1.2845953002610966) internal successors, (492), 386 states have internal predecessors, (492), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-08 16:43:03,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 608 transitions. [2024-11-08 16:43:03,136 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 608 transitions. Word has length 146 [2024-11-08 16:43:03,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:03,137 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 608 transitions. [2024-11-08 16:43:03,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 16:43:03,137 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 608 transitions. [2024-11-08 16:43:03,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 16:43:03,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:03,141 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:03,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 16:43:03,141 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:03,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:03,142 INFO L85 PathProgramCache]: Analyzing trace with hash 130314806, now seen corresponding path program 1 times [2024-11-08 16:43:03,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:03,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068319999] [2024-11-08 16:43:03,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:03,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:43:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:43:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:43:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:43:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:43:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:43:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:43:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:43:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:43:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:43:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,451 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:43:03,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:03,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068319999] [2024-11-08 16:43:03,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068319999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:03,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:03,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:43:03,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967832906] [2024-11-08 16:43:03,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:03,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:43:03,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:03,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:43:03,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:43:03,456 INFO L87 Difference]: Start difference. First operand 451 states and 608 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:43:03,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:03,636 INFO L93 Difference]: Finished difference Result 914 states and 1233 transitions. [2024-11-08 16:43:03,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:43:03,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-08 16:43:03,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:03,643 INFO L225 Difference]: With dead ends: 914 [2024-11-08 16:43:03,644 INFO L226 Difference]: Without dead ends: 466 [2024-11-08 16:43:03,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:43:03,646 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:03,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 576 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:43:03,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-08 16:43:03,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2024-11-08 16:43:03,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 398 states have (on average 1.2738693467336684) internal successors, (507), 401 states have internal predecessors, (507), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-08 16:43:03,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 623 transitions. [2024-11-08 16:43:03,715 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 623 transitions. Word has length 147 [2024-11-08 16:43:03,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:03,715 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 623 transitions. [2024-11-08 16:43:03,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:43:03,716 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 623 transitions. [2024-11-08 16:43:03,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 16:43:03,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:03,719 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:03,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 16:43:03,719 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:03,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:03,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1191650304, now seen corresponding path program 1 times [2024-11-08 16:43:03,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:03,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674825858] [2024-11-08 16:43:03,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:03,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:43:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:43:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:43:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:43:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:43:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:03,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:04,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:04,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:04,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:04,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:43:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:04,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:43:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:04,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:43:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:04,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:43:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:04,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:43:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:04,025 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:43:04,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:04,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674825858] [2024-11-08 16:43:04,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674825858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:04,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:04,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:43:04,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356744466] [2024-11-08 16:43:04,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:04,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:43:04,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:04,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:43:04,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:43:04,027 INFO L87 Difference]: Start difference. First operand 466 states and 623 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:43:04,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:04,136 INFO L93 Difference]: Finished difference Result 949 states and 1268 transitions. [2024-11-08 16:43:04,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:43:04,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-08 16:43:04,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:04,140 INFO L225 Difference]: With dead ends: 949 [2024-11-08 16:43:04,141 INFO L226 Difference]: Without dead ends: 486 [2024-11-08 16:43:04,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:43:04,143 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:04,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 725 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:43:04,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-11-08 16:43:04,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 480. [2024-11-08 16:43:04,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 412 states have (on average 1.2645631067961165) internal successors, (521), 415 states have internal predecessors, (521), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-08 16:43:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 637 transitions. [2024-11-08 16:43:04,215 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 637 transitions. Word has length 147 [2024-11-08 16:43:04,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:04,216 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 637 transitions. [2024-11-08 16:43:04,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:43:04,217 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 637 transitions. [2024-11-08 16:43:04,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 16:43:04,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:04,220 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:04,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 16:43:04,221 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:04,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:04,221 INFO L85 PathProgramCache]: Analyzing trace with hash 578909450, now seen corresponding path program 1 times [2024-11-08 16:43:04,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:04,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109012552] [2024-11-08 16:43:04,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:04,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:06,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:06,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:06,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:43:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:06,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:43:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:06,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:06,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:43:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:06,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:43:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:06,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:06,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:43:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:06,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:06,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:06,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:06,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:06,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:43:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:06,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:43:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:06,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:43:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:06,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:43:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:06,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:43:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:06,161 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:43:06,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:06,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109012552] [2024-11-08 16:43:06,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109012552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:06,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:06,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 16:43:06,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397911802] [2024-11-08 16:43:06,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:06,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 16:43:06,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:06,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 16:43:06,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:43:06,164 INFO L87 Difference]: Start difference. First operand 480 states and 637 transitions. Second operand has 16 states, 14 states have (on average 4.357142857142857) internal successors, (61), 16 states have internal predecessors, (61), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-08 16:43:07,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:07,606 INFO L93 Difference]: Finished difference Result 747 states and 989 transitions. [2024-11-08 16:43:07,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 16:43:07,607 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.357142857142857) internal successors, (61), 16 states have internal predecessors, (61), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) Word has length 148 [2024-11-08 16:43:07,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:07,610 INFO L225 Difference]: With dead ends: 747 [2024-11-08 16:43:07,611 INFO L226 Difference]: Without dead ends: 528 [2024-11-08 16:43:07,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2024-11-08 16:43:07,614 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 438 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:07,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1347 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 16:43:07,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-08 16:43:07,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 523. [2024-11-08 16:43:07,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 452 states have (on average 1.2654867256637168) internal successors, (572), 456 states have internal predecessors, (572), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 16:43:07,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 692 transitions. [2024-11-08 16:43:07,702 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 692 transitions. Word has length 148 [2024-11-08 16:43:07,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:07,703 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 692 transitions. [2024-11-08 16:43:07,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.357142857142857) internal successors, (61), 16 states have internal predecessors, (61), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-08 16:43:07,703 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 692 transitions. [2024-11-08 16:43:07,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 16:43:07,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:07,706 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:07,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 16:43:07,707 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:07,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:07,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1279974028, now seen corresponding path program 1 times [2024-11-08 16:43:07,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:07,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499145769] [2024-11-08 16:43:07,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:07,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:08,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:08,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:08,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:43:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:08,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:43:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:08,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:08,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:43:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:08,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:43:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:08,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:08,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:43:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:08,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:08,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:08,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:08,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:08,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:43:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:08,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:43:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:08,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:43:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:08,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:43:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:08,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:43:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:43:08,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:08,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499145769] [2024-11-08 16:43:08,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499145769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:08,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:08,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:43:08,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834953597] [2024-11-08 16:43:08,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:08,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:43:08,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:08,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:43:08,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:43:08,556 INFO L87 Difference]: Start difference. First operand 523 states and 692 transitions. Second operand has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 16:43:09,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:09,115 INFO L93 Difference]: Finished difference Result 1113 states and 1471 transitions. [2024-11-08 16:43:09,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:43:09,116 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 148 [2024-11-08 16:43:09,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:09,120 INFO L225 Difference]: With dead ends: 1113 [2024-11-08 16:43:09,120 INFO L226 Difference]: Without dead ends: 593 [2024-11-08 16:43:09,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:43:09,122 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 402 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:09,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 670 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:43:09,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-11-08 16:43:09,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 521. [2024-11-08 16:43:09,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 450 states have (on average 1.2555555555555555) internal successors, (565), 454 states have internal predecessors, (565), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 16:43:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 685 transitions. [2024-11-08 16:43:09,227 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 685 transitions. Word has length 148 [2024-11-08 16:43:09,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:09,228 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 685 transitions. [2024-11-08 16:43:09,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 16:43:09,228 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 685 transitions. [2024-11-08 16:43:09,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 16:43:09,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:09,230 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:09,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 16:43:09,231 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:09,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:09,231 INFO L85 PathProgramCache]: Analyzing trace with hash 462325578, now seen corresponding path program 1 times [2024-11-08 16:43:09,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:09,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116522422] [2024-11-08 16:43:09,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:09,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:10,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:10,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:10,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:43:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:10,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:43:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:10,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:10,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:43:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:10,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:43:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:10,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:11,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:43:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:11,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:11,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:11,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:11,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:11,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:43:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:11,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:43:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:11,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:43:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:11,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:43:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:11,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:43:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:11,040 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:43:11,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:11,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116522422] [2024-11-08 16:43:11,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116522422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:11,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:11,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 16:43:11,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159959274] [2024-11-08 16:43:11,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:11,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 16:43:11,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:11,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 16:43:11,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:43:11,043 INFO L87 Difference]: Start difference. First operand 521 states and 685 transitions. Second operand has 14 states, 12 states have (on average 5.083333333333333) internal successors, (61), 14 states have internal predecessors, (61), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-08 16:43:12,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:12,238 INFO L93 Difference]: Finished difference Result 786 states and 1031 transitions. [2024-11-08 16:43:12,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 16:43:12,239 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.083333333333333) internal successors, (61), 14 states have internal predecessors, (61), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) Word has length 148 [2024-11-08 16:43:12,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:12,242 INFO L225 Difference]: With dead ends: 786 [2024-11-08 16:43:12,243 INFO L226 Difference]: Without dead ends: 525 [2024-11-08 16:43:12,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2024-11-08 16:43:12,244 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 290 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:12,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 1473 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 16:43:12,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-08 16:43:12,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 264. [2024-11-08 16:43:12,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 228 states have (on average 1.25) internal successors, (285), 230 states have internal predecessors, (285), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 16:43:12,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 345 transitions. [2024-11-08 16:43:12,307 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 345 transitions. Word has length 148 [2024-11-08 16:43:12,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:12,308 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 345 transitions. [2024-11-08 16:43:12,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.083333333333333) internal successors, (61), 14 states have internal predecessors, (61), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-08 16:43:12,308 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 345 transitions. [2024-11-08 16:43:12,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 16:43:12,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:12,311 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:12,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 16:43:12,311 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:12,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:12,312 INFO L85 PathProgramCache]: Analyzing trace with hash -193456547, now seen corresponding path program 1 times [2024-11-08 16:43:12,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:12,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074309815] [2024-11-08 16:43:12,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:12,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:43:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:43:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:43:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:43:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:43:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:43:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:43:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:43:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:43:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:43:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:43:12,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:12,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074309815] [2024-11-08 16:43:12,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074309815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:12,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:12,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:43:12,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544860742] [2024-11-08 16:43:12,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:12,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:43:12,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:12,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:43:12,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:43:12,962 INFO L87 Difference]: Start difference. First operand 264 states and 345 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:43:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:13,165 INFO L93 Difference]: Finished difference Result 694 states and 902 transitions. [2024-11-08 16:43:13,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:43:13,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-11-08 16:43:13,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:13,168 INFO L225 Difference]: With dead ends: 694 [2024-11-08 16:43:13,168 INFO L226 Difference]: Without dead ends: 433 [2024-11-08 16:43:13,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 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-08 16:43:13,169 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 58 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:13,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 572 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:43:13,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-08 16:43:13,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 368. [2024-11-08 16:43:13,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 329 states have (on average 1.2583586626139818) internal successors, (414), 332 states have internal predecessors, (414), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 16:43:13,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 478 transitions. [2024-11-08 16:43:13,224 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 478 transitions. Word has length 149 [2024-11-08 16:43:13,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:13,224 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 478 transitions. [2024-11-08 16:43:13,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:43:13,225 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 478 transitions. [2024-11-08 16:43:13,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 16:43:13,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:13,227 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:13,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 16:43:13,228 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:13,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:13,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1071803151, now seen corresponding path program 1 times [2024-11-08 16:43:13,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:13,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250770367] [2024-11-08 16:43:13,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:13,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:43:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:43:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:43:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:43:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:43:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:43:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:43:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:43:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:43:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:43:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,750 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:43:14,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:14,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250770367] [2024-11-08 16:43:14,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250770367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:14,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:14,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:43:14,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721163173] [2024-11-08 16:43:14,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:14,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:43:14,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:14,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:43:14,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:43:14,753 INFO L87 Difference]: Start difference. First operand 368 states and 478 transitions. Second operand has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-08 16:43:15,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:15,457 INFO L93 Difference]: Finished difference Result 723 states and 933 transitions. [2024-11-08 16:43:15,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:43:15,458 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 149 [2024-11-08 16:43:15,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:15,461 INFO L225 Difference]: With dead ends: 723 [2024-11-08 16:43:15,462 INFO L226 Difference]: Without dead ends: 721 [2024-11-08 16:43:15,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:43:15,463 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 261 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:15,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1272 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:43:15,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2024-11-08 16:43:15,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 535. [2024-11-08 16:43:15,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 496 states have (on average 1.2620967741935485) internal successors, (626), 499 states have internal predecessors, (626), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 16:43:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 690 transitions. [2024-11-08 16:43:15,537 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 690 transitions. Word has length 149 [2024-11-08 16:43:15,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:15,538 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 690 transitions. [2024-11-08 16:43:15,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-08 16:43:15,538 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 690 transitions. [2024-11-08 16:43:15,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 16:43:15,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:15,541 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:15,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 16:43:15,541 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:15,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:15,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1776005899, now seen corresponding path program 1 times [2024-11-08 16:43:15,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:15,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198315057] [2024-11-08 16:43:15,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:15,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:15,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:15,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:15,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:43:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:15,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:43:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:15,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:15,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:43:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:15,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:43:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:15,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:15,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:43:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:15,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:15,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:15,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:15,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:15,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:43:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:15,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:43:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:15,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:43:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:15,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:43:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:15,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:43:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:15,850 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:43:15,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:15,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198315057] [2024-11-08 16:43:15,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198315057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:15,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:15,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:43:15,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487764895] [2024-11-08 16:43:15,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:15,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:43:15,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:15,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:43:15,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:43:15,853 INFO L87 Difference]: Start difference. First operand 535 states and 690 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:43:15,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:15,979 INFO L93 Difference]: Finished difference Result 1119 states and 1437 transitions. [2024-11-08 16:43:15,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:43:15,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-11-08 16:43:15,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:15,984 INFO L225 Difference]: With dead ends: 1119 [2024-11-08 16:43:15,984 INFO L226 Difference]: Without dead ends: 587 [2024-11-08 16:43:15,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:43:15,986 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:15,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 865 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:43:15,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2024-11-08 16:43:16,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 543. [2024-11-08 16:43:16,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 504 states have (on average 1.257936507936508) internal successors, (634), 507 states have internal predecessors, (634), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 16:43:16,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 698 transitions. [2024-11-08 16:43:16,060 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 698 transitions. Word has length 149 [2024-11-08 16:43:16,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:16,061 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 698 transitions. [2024-11-08 16:43:16,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:43:16,062 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 698 transitions. [2024-11-08 16:43:16,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 16:43:16,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:16,065 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:16,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 16:43:16,065 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:16,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:16,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1227539253, now seen corresponding path program 1 times [2024-11-08 16:43:16,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:16,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538774453] [2024-11-08 16:43:16,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:16,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:17,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:17,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:17,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:43:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:17,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:43:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:17,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:17,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:43:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:17,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:43:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:17,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:17,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:43:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:17,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:17,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:17,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:17,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:17,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:43:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:17,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:43:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:17,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:43:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:17,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:43:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:17,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:43:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 16:43:17,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:17,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538774453] [2024-11-08 16:43:17,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538774453] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:43:17,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301497571] [2024-11-08 16:43:17,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:17,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:43:17,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:43:17,310 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:43:17,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 16:43:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:18,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-08 16:43:18,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:43:18,414 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 15 treesize of output 1 [2024-11-08 16:43:18,751 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-08 16:43:20,848 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 14 proven. 234 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 16:43:20,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:43:21,280 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 16 treesize of output 12 [2024-11-08 16:43:23,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301497571] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:43:23,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:43:23,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20] total 31 [2024-11-08 16:43:23,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758070952] [2024-11-08 16:43:23,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:43:23,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-08 16:43:23,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:23,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-08 16:43:23,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=1750, Unknown=0, NotChecked=0, Total=2162 [2024-11-08 16:43:23,061 INFO L87 Difference]: Start difference. First operand 543 states and 698 transitions. Second operand has 31 states, 27 states have (on average 4.518518518518518) internal successors, (122), 26 states have internal predecessors, (122), 8 states have call successors, (36), 6 states have call predecessors, (36), 7 states have return successors, (36), 6 states have call predecessors, (36), 8 states have call successors, (36) [2024-11-08 16:43:26,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:26,856 INFO L93 Difference]: Finished difference Result 1902 states and 2438 transitions. [2024-11-08 16:43:26,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-08 16:43:26,857 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 4.518518518518518) internal successors, (122), 26 states have internal predecessors, (122), 8 states have call successors, (36), 6 states have call predecessors, (36), 7 states have return successors, (36), 6 states have call predecessors, (36), 8 states have call successors, (36) Word has length 151 [2024-11-08 16:43:26,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:26,864 INFO L225 Difference]: With dead ends: 1902 [2024-11-08 16:43:26,864 INFO L226 Difference]: Without dead ends: 1362 [2024-11-08 16:43:26,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1848 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1385, Invalid=6447, Unknown=0, NotChecked=0, Total=7832 [2024-11-08 16:43:26,869 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 1026 mSDsluCounter, 2078 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 2193 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:26,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 2193 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 16:43:26,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2024-11-08 16:43:27,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 917. [2024-11-08 16:43:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 819 states have (on average 1.2478632478632479) internal successors, (1022), 823 states have internal predecessors, (1022), 78 states have call successors, (78), 19 states have call predecessors, (78), 19 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-08 16:43:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1178 transitions. [2024-11-08 16:43:27,016 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1178 transitions. Word has length 151 [2024-11-08 16:43:27,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:27,017 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1178 transitions. [2024-11-08 16:43:27,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 4.518518518518518) internal successors, (122), 26 states have internal predecessors, (122), 8 states have call successors, (36), 6 states have call predecessors, (36), 7 states have return successors, (36), 6 states have call predecessors, (36), 8 states have call successors, (36) [2024-11-08 16:43:27,018 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1178 transitions. [2024-11-08 16:43:27,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 16:43:27,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:27,021 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:27,047 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 16:43:27,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:43:27,226 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:27,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:27,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1619628751, now seen corresponding path program 1 times [2024-11-08 16:43:27,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:27,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675595551] [2024-11-08 16:43:27,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:27,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:28,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:28,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:28,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:43:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:28,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:43:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:28,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:28,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:43:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:28,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:43:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:28,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:28,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:43:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:28,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:28,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:28,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:28,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:28,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:43:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:28,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:43:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:28,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:43:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:28,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:43:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:28,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:43:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:28,213 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 16:43:28,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:28,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675595551] [2024-11-08 16:43:28,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675595551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:43:28,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153052182] [2024-11-08 16:43:28,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:28,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:43:28,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:43:28,216 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:43:28,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 16:43:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:28,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 16:43:28,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:43:28,700 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 15 treesize of output 1 [2024-11-08 16:43:29,124 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 17 treesize of output 9 [2024-11-08 16:43:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 17 proven. 51 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:43:29,160 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:43:29,632 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 32 treesize of output 28 [2024-11-08 16:43:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 16:43:29,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153052182] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:43:29,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:43:29,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2024-11-08 16:43:29,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970818783] [2024-11-08 16:43:29,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:43:29,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 16:43:29,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:29,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 16:43:29,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2024-11-08 16:43:29,668 INFO L87 Difference]: Start difference. First operand 917 states and 1178 transitions. Second operand has 24 states, 21 states have (on average 6.904761904761905) internal successors, (145), 24 states have internal predecessors, (145), 6 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (54), 3 states have call predecessors, (54), 6 states have call successors, (54) [2024-11-08 16:43:31,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:31,351 INFO L93 Difference]: Finished difference Result 1728 states and 2209 transitions. [2024-11-08 16:43:31,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-08 16:43:31,352 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 6.904761904761905) internal successors, (145), 24 states have internal predecessors, (145), 6 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (54), 3 states have call predecessors, (54), 6 states have call successors, (54) Word has length 151 [2024-11-08 16:43:31,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:31,357 INFO L225 Difference]: With dead ends: 1728 [2024-11-08 16:43:31,357 INFO L226 Difference]: Without dead ends: 902 [2024-11-08 16:43:31,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=364, Invalid=1798, Unknown=0, NotChecked=0, Total=2162 [2024-11-08 16:43:31,360 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 865 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:31,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 1298 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 16:43:31,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-11-08 16:43:31,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 878. [2024-11-08 16:43:31,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 773 states have (on average 1.243208279430789) internal successors, (961), 777 states have internal predecessors, (961), 78 states have call successors, (78), 26 states have call predecessors, (78), 26 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-08 16:43:31,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1117 transitions. [2024-11-08 16:43:31,511 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1117 transitions. Word has length 151 [2024-11-08 16:43:31,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:31,511 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1117 transitions. [2024-11-08 16:43:31,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 6.904761904761905) internal successors, (145), 24 states have internal predecessors, (145), 6 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (54), 3 states have call predecessors, (54), 6 states have call successors, (54) [2024-11-08 16:43:31,512 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1117 transitions. [2024-11-08 16:43:31,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 16:43:31,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:31,514 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:31,537 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 16:43:31,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:43:31,715 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:31,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:31,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1261758744, now seen corresponding path program 1 times [2024-11-08 16:43:31,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:31,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166881890] [2024-11-08 16:43:31,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:31,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:32,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:32,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:32,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:43:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:32,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:43:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:32,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:32,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:43:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:32,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:43:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:32,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:32,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:43:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:32,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:32,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:32,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:32,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:32,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:43:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:32,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:43:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:32,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:43:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:32,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:43:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:32,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:43:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:32,465 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 16:43:32,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:32,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166881890] [2024-11-08 16:43:32,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166881890] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:43:32,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614543215] [2024-11-08 16:43:32,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:32,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:43:32,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:43:32,468 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:43:32,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 16:43:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:32,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 16:43:32,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:43:33,050 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 15 treesize of output 1 [2024-11-08 16:43:33,249 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 15 treesize of output 11 [2024-11-08 16:43:33,376 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 19 treesize of output 11 [2024-11-08 16:43:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 10 proven. 338 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:43:33,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:43:33,792 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 27 treesize of output 23 [2024-11-08 16:43:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 16:43:33,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614543215] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:43:33,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:43:33,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 21 [2024-11-08 16:43:33,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387631067] [2024-11-08 16:43:33,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:43:33,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 16:43:33,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:33,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 16:43:33,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2024-11-08 16:43:33,882 INFO L87 Difference]: Start difference. First operand 878 states and 1117 transitions. Second operand has 21 states, 17 states have (on average 8.764705882352942) internal successors, (149), 20 states have internal predecessors, (149), 8 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (54), 5 states have call predecessors, (54), 8 states have call successors, (54) [2024-11-08 16:43:35,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:35,242 INFO L93 Difference]: Finished difference Result 1611 states and 2028 transitions. [2024-11-08 16:43:35,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 16:43:35,248 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 8.764705882352942) internal successors, (149), 20 states have internal predecessors, (149), 8 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (54), 5 states have call predecessors, (54), 8 states have call successors, (54) Word has length 152 [2024-11-08 16:43:35,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:35,254 INFO L225 Difference]: With dead ends: 1611 [2024-11-08 16:43:35,255 INFO L226 Difference]: Without dead ends: 828 [2024-11-08 16:43:35,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 329 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=395, Invalid=1327, Unknown=0, NotChecked=0, Total=1722 [2024-11-08 16:43:35,258 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 726 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:35,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 801 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:43:35,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2024-11-08 16:43:35,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 802. [2024-11-08 16:43:35,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 692 states have (on average 1.2095375722543353) internal successors, (837), 696 states have internal predecessors, (837), 78 states have call successors, (78), 31 states have call predecessors, (78), 31 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-08 16:43:35,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 993 transitions. [2024-11-08 16:43:35,435 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 993 transitions. Word has length 152 [2024-11-08 16:43:35,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:35,435 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 993 transitions. [2024-11-08 16:43:35,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 8.764705882352942) internal successors, (149), 20 states have internal predecessors, (149), 8 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (54), 5 states have call predecessors, (54), 8 states have call successors, (54) [2024-11-08 16:43:35,436 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 993 transitions. [2024-11-08 16:43:35,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 16:43:35,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:35,437 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:35,460 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 16:43:35,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:43:35,638 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:35,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:35,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1498251302, now seen corresponding path program 1 times [2024-11-08 16:43:35,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:35,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932084695] [2024-11-08 16:43:35,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:35,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:37,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:37,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:37,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:43:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:37,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:43:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:37,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:37,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:43:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:37,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:43:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:37,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:43:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:37,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:43:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:37,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:43:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:37,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:43:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:37,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:43:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:37,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:37,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:43:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:37,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:43:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:37,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:43:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:37,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:43:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:37,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:43:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:37,644 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 84 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2024-11-08 16:43:37,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:37,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932084695] [2024-11-08 16:43:37,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932084695] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:43:37,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587515087] [2024-11-08 16:43:37,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:37,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:43:37,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:43:37,648 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:43:37,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 16:43:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:38,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-08 16:43:38,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:43:39,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 15 treesize of output 1 [2024-11-08 16:43:39,918 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-08 16:43:41,293 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 15 treesize of output 1 [2024-11-08 16:43:41,567 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 15 treesize of output 1 [2024-11-08 16:43:42,709 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 17 treesize of output 9 [2024-11-08 16:43:42,717 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 17 treesize of output 9 [2024-11-08 16:43:42,727 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 26 treesize of output 14 [2024-11-08 16:43:42,814 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 16 proven. 510 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-08 16:43:42,815 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:43:44,233 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 64 treesize of output 60 [2024-11-08 16:43:46,362 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 32 treesize of output 28 [2024-11-08 16:44:41,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587515087] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:44:41,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:44:41,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 24] total 39 [2024-11-08 16:44:41,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961583950] [2024-11-08 16:44:41,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:44:41,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-08 16:44:41,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:44:41,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-08 16:44:41,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=2608, Unknown=7, NotChecked=0, Total=2862 [2024-11-08 16:44:41,567 INFO L87 Difference]: Start difference. First operand 802 states and 993 transitions. Second operand has 39 states, 31 states have (on average 4.838709677419355) internal successors, (150), 31 states have internal predecessors, (150), 17 states have call successors, (36), 9 states have call predecessors, (36), 11 states have return successors, (36), 14 states have call predecessors, (36), 17 states have call successors, (36) [2024-11-08 16:45:38,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:38,324 INFO L93 Difference]: Finished difference Result 1396 states and 1704 transitions. [2024-11-08 16:45:38,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-08 16:45:38,325 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 4.838709677419355) internal successors, (150), 31 states have internal predecessors, (150), 17 states have call successors, (36), 9 states have call predecessors, (36), 11 states have return successors, (36), 14 states have call predecessors, (36), 17 states have call successors, (36) Word has length 154 [2024-11-08 16:45:38,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:38,329 INFO L225 Difference]: With dead ends: 1396 [2024-11-08 16:45:38,330 INFO L226 Difference]: Without dead ends: 693 [2024-11-08 16:45:38,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2638 ImplicationChecksByTransitivity, 109.2s TimeCoverageRelationStatistics Valid=1505, Invalid=9830, Unknown=7, NotChecked=0, Total=11342 [2024-11-08 16:45:38,335 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 1449 mSDsluCounter, 1933 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 423 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 2033 SdHoareTripleChecker+Invalid, 2036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 423 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:38,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1449 Valid, 2033 Invalid, 2036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [423 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-08 16:45:38,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-11-08 16:45:38,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 463. [2024-11-08 16:45:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 395 states have (on average 1.2025316455696202) internal successors, (475), 396 states have internal predecessors, (475), 46 states have call successors, (46), 21 states have call predecessors, (46), 21 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 16:45:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 567 transitions. [2024-11-08 16:45:38,427 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 567 transitions. Word has length 154 [2024-11-08 16:45:38,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:38,428 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 567 transitions. [2024-11-08 16:45:38,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 4.838709677419355) internal successors, (150), 31 states have internal predecessors, (150), 17 states have call successors, (36), 9 states have call predecessors, (36), 11 states have return successors, (36), 14 states have call predecessors, (36), 17 states have call successors, (36) [2024-11-08 16:45:38,428 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 567 transitions. [2024-11-08 16:45:38,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 16:45:38,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:38,429 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:38,453 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 16:45:38,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:45:38,630 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:38,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:38,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2129374559, now seen corresponding path program 1 times [2024-11-08 16:45:38,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:45:38,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802036270] [2024-11-08 16:45:38,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:38,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:45:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:45:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:45:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:45:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:45:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:45:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:45:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:45:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:45:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:45:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:45:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:45:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:45:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:45:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:45:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:45:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:45:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:45:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:45:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,652 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:45:39,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:45:39,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802036270] [2024-11-08 16:45:39,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802036270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:39,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:39,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:45:39,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518101220] [2024-11-08 16:45:39,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:39,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:45:39,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:45:39,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:45:39,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:45:39,655 INFO L87 Difference]: Start difference. First operand 463 states and 567 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:45:40,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:40,653 INFO L93 Difference]: Finished difference Result 759 states and 928 transitions. [2024-11-08 16:45:40,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:45:40,654 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 154 [2024-11-08 16:45:40,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:40,657 INFO L225 Difference]: With dead ends: 759 [2024-11-08 16:45:40,658 INFO L226 Difference]: Without dead ends: 467 [2024-11-08 16:45:40,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:45:40,659 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 101 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:40,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1480 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 16:45:40,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-11-08 16:45:40,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 458. [2024-11-08 16:45:40,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 389 states have (on average 1.1979434447300772) internal successors, (466), 390 states have internal predecessors, (466), 46 states have call successors, (46), 22 states have call predecessors, (46), 22 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 16:45:40,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 558 transitions. [2024-11-08 16:45:40,788 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 558 transitions. Word has length 154 [2024-11-08 16:45:40,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:40,789 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 558 transitions. [2024-11-08 16:45:40,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:45:40,790 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 558 transitions. [2024-11-08 16:45:40,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 16:45:40,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:40,791 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:40,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 16:45:40,791 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:40,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:40,792 INFO L85 PathProgramCache]: Analyzing trace with hash -2077705356, now seen corresponding path program 1 times [2024-11-08 16:45:40,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:45:40,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896157396] [2024-11-08 16:45:40,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:40,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:45:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:45:41,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:45:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:45:41,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:45:41,304 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:45:41,305 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 16:45:41,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 16:45:41,310 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:45:41,553 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:45:41,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:45:41 BoogieIcfgContainer [2024-11-08 16:45:41,558 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:45:41,559 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:45:41,559 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:45:41,559 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:45:41,559 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:42:41" (3/4) ... [2024-11-08 16:45:41,562 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 16:45:41,563 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:45:41,564 INFO L158 Benchmark]: Toolchain (without parser) took 182256.34ms. Allocated memory was 151.0MB in the beginning and 847.2MB in the end (delta: 696.3MB). Free memory was 112.0MB in the beginning and 388.6MB in the end (delta: -276.6MB). Peak memory consumption was 419.0MB. Max. memory is 16.1GB. [2024-11-08 16:45:41,566 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 111.1MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:45:41,566 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.41ms. Allocated memory is still 151.0MB. Free memory was 112.0MB in the beginning and 110.9MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:45:41,566 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.02ms. Allocated memory is still 151.0MB. Free memory was 110.9MB in the beginning and 106.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:45:41,567 INFO L158 Benchmark]: Boogie Preprocessor took 144.77ms. Allocated memory is still 151.0MB. Free memory was 106.8MB in the beginning and 100.9MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 16:45:41,567 INFO L158 Benchmark]: RCFGBuilder took 1107.58ms. Allocated memory is still 151.0MB. Free memory was 100.9MB in the beginning and 54.8MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-08 16:45:41,567 INFO L158 Benchmark]: TraceAbstraction took 180374.99ms. Allocated memory was 151.0MB in the beginning and 847.2MB in the end (delta: 696.3MB). Free memory was 53.9MB in the beginning and 388.6MB in the end (delta: -334.7MB). Peak memory consumption was 364.0MB. Max. memory is 16.1GB. [2024-11-08 16:45:41,567 INFO L158 Benchmark]: Witness Printer took 4.68ms. Allocated memory is still 847.2MB. Free memory is still 388.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:45:41,568 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.30ms. Allocated memory is still 111.1MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 545.41ms. Allocated memory is still 151.0MB. Free memory was 112.0MB in the beginning and 110.9MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.02ms. Allocated memory is still 151.0MB. Free memory was 110.9MB in the beginning and 106.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 144.77ms. Allocated memory is still 151.0MB. Free memory was 106.8MB in the beginning and 100.9MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1107.58ms. Allocated memory is still 151.0MB. Free memory was 100.9MB in the beginning and 54.8MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 180374.99ms. Allocated memory was 151.0MB in the beginning and 847.2MB in the end (delta: 696.3MB). Free memory was 53.9MB in the beginning and 388.6MB in the end (delta: -334.7MB). Peak memory consumption was 364.0MB. Max. memory is 16.1GB. * Witness Printer took 4.68ms. Allocated memory is still 847.2MB. Free memory is still 388.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 5; [L22] unsigned long int var_1_1 = 5; [L23] unsigned long int* var_1_1_Pointer = &(var_1_1); [L24] unsigned long int var_1_3 = 1456677701; [L24] unsigned long int var_1_3 = 1456677701; [L25] unsigned long int* var_1_3_Pointer = &(var_1_3); [L26] unsigned long int var_1_4 = 1000000000; [L26] unsigned long int var_1_4 = 1000000000; [L27] unsigned long int* var_1_4_Pointer = &(var_1_4); [L28] unsigned long int var_1_5 = 1; [L28] unsigned long int var_1_5 = 1; [L29] unsigned long int* var_1_5_Pointer = &(var_1_5); [L30] unsigned char var_1_6 = 0; [L30] unsigned char var_1_6 = 0; [L31] unsigned char* var_1_6_Pointer = &(var_1_6); [L32] unsigned char var_1_7 = 0; [L32] unsigned char var_1_7 = 0; [L33] unsigned char* var_1_7_Pointer = &(var_1_7); [L34] unsigned char var_1_8 = 0; [L34] unsigned char var_1_8 = 0; [L35] unsigned char* var_1_8_Pointer = &(var_1_8); [L36] double var_1_9 = 256.5; [L36] double var_1_9 = 256.5; [L37] double* var_1_9_Pointer = &(var_1_9); [L38] double var_1_10 = 8.8; [L38] double var_1_10 = 8.8; [L39] double* var_1_10_Pointer = &(var_1_10); [L40] unsigned char var_1_11 = 1; [L40] unsigned char var_1_11 = 1; [L41] unsigned char* var_1_11_Pointer = &(var_1_11); [L42] unsigned short int var_1_12 = 16; [L42] unsigned short int var_1_12 = 16; [L43] unsigned short int* var_1_12_Pointer = &(var_1_12); [L44] unsigned long int var_1_13 = 3110219175; [L44] unsigned long int var_1_13 = 3110219175; [L45] unsigned long int* var_1_13_Pointer = &(var_1_13); [L46] unsigned short int var_1_14 = 128; [L46] unsigned short int var_1_14 = 128; [L47] unsigned short int* var_1_14_Pointer = &(var_1_14); [L48] unsigned char var_1_15 = 1; [L48] unsigned char var_1_15 = 1; [L49] unsigned char* var_1_15_Pointer = &(var_1_15); [L50] unsigned char var_1_16 = 0; [L50] unsigned char var_1_16 = 0; [L51] unsigned char* var_1_16_Pointer = &(var_1_16); VAL [isInitial=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] FCALL updateLastVariables() [L122] CALL updateVariables() [L82] var_1_3 = __VERIFIER_nondet_ulong() [L83] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L83] CALL assume_abort_if_not(var_1_3 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L83] RET assume_abort_if_not(var_1_3 >= 1073741823) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L85] var_1_4 = __VERIFIER_nondet_ulong() [L86] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L86] CALL assume_abort_if_not(var_1_4 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L86] RET assume_abort_if_not(var_1_4 >= 536870911) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L88] var_1_5 = __VERIFIER_nondet_ulong() [L89] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L90] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L90] CALL assume_abort_if_not(var_1_5 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L90] RET assume_abort_if_not(var_1_5 <= 536870911) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L92] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L92] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] var_1_9 = __VERIFIER_nondet_double() [L95] EXPR \read(var_1_9) [L95] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F [L95] EXPR \read(var_1_9) [L95] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] EXPR (var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] EXPR (var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L96] var_1_10 = __VERIFIER_nondet_double() [L97] EXPR \read(var_1_10) [L97] EXPR var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] EXPR var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F [L97] EXPR \read(var_1_10) [L97] EXPR var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] EXPR (var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] EXPR (var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L98] var_1_11 = __VERIFIER_nondet_uchar() [L99] EXPR \read(var_1_11) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L99] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L99] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] EXPR \read(var_1_11) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L101] var_1_13 = __VERIFIER_nondet_ulong() [L102] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] CALL assume_abort_if_not(var_1_13 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] RET assume_abort_if_not(var_1_13 <= 4294967295) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L104] var_1_14 = __VERIFIER_nondet_ushort() [L105] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L105] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L105] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L106] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L106] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L106] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L107] var_1_16 = __VERIFIER_nondet_uchar() [L108] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L109] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L109] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L109] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L122] RET updateVariables() [L123] CALL step() [L55] EXPR \read(*var_1_7_Pointer) [L55] (*(var_1_6_Pointer)) = (*(var_1_7_Pointer)) [L56] EXPR \read(*var_1_5_Pointer) [L56] EXPR \read(*var_1_13_Pointer) [L56] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L56] COND TRUE (*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer))) [L57] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L57] EXPR (((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))) [L57] EXPR \read(*var_1_14_Pointer) [L57] EXPR (((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L57] (*(var_1_12_Pointer)) = (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))) [L59] EXPR \read(*var_1_9_Pointer) [L59] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L59] COND TRUE ((*(var_1_9_Pointer)) * 16.5f) > (*(var_1_10_Pointer)) [L60] EXPR \read(*var_1_11_Pointer) [L60] (*(var_1_15_Pointer)) = (! (*(var_1_11_Pointer))) [L64] EXPR \read(*var_1_12_Pointer) [L64] EXPR \read(*var_1_3_Pointer) [L64] EXPR \read(*var_1_4_Pointer) [L64] EXPR \read(*var_1_12_Pointer) [L64] (*(var_1_1_Pointer)) = ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))) [L65] EXPR \read(*var_1_12_Pointer) [L65] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L65] EXPR (((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))) [L65] EXPR \read(*var_1_12_Pointer) [L65] EXPR (((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L65] signed long int stepLocal_1 = ((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer)))); [L66] EXPR \read(*var_1_3_Pointer) [L66] unsigned long int stepLocal_0 = (*(var_1_3_Pointer)); [L67] EXPR \read(*var_1_4_Pointer) [L67] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L67] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))) [L67] EXPR \read(*var_1_4_Pointer) [L67] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))) VAL [isInitial=1, stepLocal_0=-3221225472, stepLocal_1=65534, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L67] COND TRUE stepLocal_1 != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))))) [L68] EXPR \read(*var_1_9_Pointer) [L68] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L68] COND FALSE !((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) [L123] RET step() [L124] CALL, EXPR property() [L114] EXPR \read(*var_1_1_Pointer) [L114] EXPR \read(*var_1_12_Pointer) [L114] EXPR \read(*var_1_3_Pointer) [L114] EXPR \read(*var_1_4_Pointer) [L114] EXPR \read(*var_1_12_Pointer) [L114] EXPR ((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer)))) [L114] EXPR \read(*var_1_6_Pointer) [L114] EXPR \read(*var_1_7_Pointer) [L114] EXPR ((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer))))) [L114] EXPR \read(*var_1_12_Pointer) [L114] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))) [L114] EXPR \read(*var_1_12_Pointer) [L114] EXPR (((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR \read(*var_1_4_Pointer) [L114] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))) [L114] EXPR \read(*var_1_4_Pointer) [L114] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))) [L114] EXPR \read(*var_1_9_Pointer) [L114] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1 [L114] EXPR ((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1 VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))))) && (((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))))) && (((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1) [L114] EXPR \read(*var_1_5_Pointer) [L114] EXPR \read(*var_1_13_Pointer) [L114] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1 [L114] EXPR \read(*var_1_12_Pointer) [L114] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))) [L114] EXPR \read(*var_1_14_Pointer) [L114] EXPR (((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1 VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))))) && (((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))))) && (((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1)) && ((((*(var_1_9_Pointer)) * 16.5f) > (*(var_1_10_Pointer))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (! (*(var_1_11_Pointer))))) : ((*(var_1_15_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) && (*(var_1_16_Pointer)))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))))) && (((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1)) && ((((*(var_1_9_Pointer)) * 16.5f) > (*(var_1_10_Pointer))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (! (*(var_1_11_Pointer))))) : ((*(var_1_15_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) && (*(var_1_16_Pointer)))))) [L114] EXPR \read(*var_1_9_Pointer) [L114] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((*(var_1_9_Pointer)) * 16.5f) > (*(var_1_10_Pointer))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (! (*(var_1_11_Pointer))))) : ((*(var_1_15_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) && (*(var_1_16_Pointer))))) [L114] EXPR \read(*var_1_15_Pointer) [L114] EXPR \read(*var_1_11_Pointer) [L114] EXPR (*(var_1_11_Pointer)) && (*(var_1_16_Pointer)) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (*(var_1_11_Pointer)) && (*(var_1_16_Pointer)) [L114] EXPR \read(*var_1_16_Pointer) [L114] EXPR (*(var_1_11_Pointer)) && (*(var_1_16_Pointer)) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((*(var_1_9_Pointer)) * 16.5f) > (*(var_1_10_Pointer))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (! (*(var_1_11_Pointer))))) : ((*(var_1_15_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) && (*(var_1_16_Pointer))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))))) && (((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1)) && ((((*(var_1_9_Pointer)) * 16.5f) > (*(var_1_10_Pointer))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (! (*(var_1_11_Pointer))))) : ((*(var_1_15_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) && (*(var_1_16_Pointer)))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114-L115] return (((((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))))) && (((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1)) && ((((*(var_1_9_Pointer)) * 16.5f) > (*(var_1_10_Pointer))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (! (*(var_1_11_Pointer))))) : ((*(var_1_15_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) && (*(var_1_16_Pointer)))))) ; [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 180.1s, OverallIterations: 26, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 75.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7611 SdHoareTripleChecker+Valid, 15.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7611 mSDsluCounter, 24520 SdHoareTripleChecker+Invalid, 14.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20741 mSDsCounter, 1315 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8926 IncrementalHoareTripleChecker+Invalid, 10241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1315 mSolverCounterUnsat, 3779 mSDtfsCounter, 8926 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2566 GetRequests, 2073 SyntacticMatches, 2 SemanticMatches, 491 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5416 ImplicationChecksByTransitivity, 120.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=917occurred in iteration=21, InterpolantAutomatonStates: 314, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 25 MinimizatonAttempts, 1637 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 95.4s InterpolantComputationTime, 4429 NumberOfCodeBlocks, 4429 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 4543 ConstructedInterpolants, 0 QuantifiedInterpolants, 28566 SizeOfPredicates, 50 NumberOfNonLiveVariables, 2721 ConjunctsInSsa, 193 ConjunctsInUnsatCore, 31 InterpolantComputations, 21 PerfectInterpolantSequences, 17527/18972 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 16:45:41,717 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e24809269f51bce916d93021d3fd241dd9f82f81ed2d62c2bdb32d3cd025077 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:45:44,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:45:44,253 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 16:45:44,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:45:44,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:45:44,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:45:44,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:45:44,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:45:44,307 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:45:44,309 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:45:44,310 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:45:44,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:45:44,311 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:45:44,311 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:45:44,315 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:45:44,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:45:44,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:45:44,316 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:45:44,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:45:44,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:45:44,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:45:44,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:45:44,318 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:45:44,318 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:45:44,318 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 16:45:44,318 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:45:44,318 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 16:45:44,319 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:45:44,319 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:45:44,319 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:45:44,319 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:45:44,320 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:45:44,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:45:44,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:45:44,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:45:44,322 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:45:44,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:45:44,324 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:45:44,324 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 16:45:44,324 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 16:45:44,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:45:44,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:45:44,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:45:44,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:45:44,337 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e24809269f51bce916d93021d3fd241dd9f82f81ed2d62c2bdb32d3cd025077 [2024-11-08 16:45:44,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:45:44,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:45:44,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:45:44,816 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:45:44,817 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:45:44,818 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i Unable to find full path for "g++" [2024-11-08 16:45:47,049 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:45:47,343 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:45:47,344 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i [2024-11-08 16:45:47,353 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/data/fe5515e9f/f047fe6ed28946a5b201287ba47afde3/FLAG765dda380 [2024-11-08 16:45:47,368 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/data/fe5515e9f/f047fe6ed28946a5b201287ba47afde3 [2024-11-08 16:45:47,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:45:47,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:45:47,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:45:47,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:45:47,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:45:47,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:45:47" (1/1) ... [2024-11-08 16:45:47,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f85ba3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:47, skipping insertion in model container [2024-11-08 16:45:47,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:45:47" (1/1) ... [2024-11-08 16:45:47,410 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:45:47,595 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i[916,929] [2024-11-08 16:45:47,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:45:47,711 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:45:47,727 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i[916,929] [2024-11-08 16:45:47,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:45:47,824 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:45:47,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:47 WrapperNode [2024-11-08 16:45:47,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:45:47,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:45:47,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:45:47,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:45:47,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:47" (1/1) ... [2024-11-08 16:45:47,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:47" (1/1) ... [2024-11-08 16:45:47,957 INFO L138 Inliner]: procedures = 36, calls = 177, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 527 [2024-11-08 16:45:47,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:45:47,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:45:47,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:45:47,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:45:47,973 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:47" (1/1) ... [2024-11-08 16:45:47,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:47" (1/1) ... [2024-11-08 16:45:47,991 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:47" (1/1) ... [2024-11-08 16:45:48,083 INFO L175 MemorySlicer]: Split 133 memory accesses to 16 slices as follows [2, 3, 12, 12, 6, 5, 10, 7, 10, 10, 12, 17, 6, 10, 5, 6]. 13 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 2, 1]. [2024-11-08 16:45:48,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:47" (1/1) ... [2024-11-08 16:45:48,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:47" (1/1) ... [2024-11-08 16:45:48,144 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:47" (1/1) ... [2024-11-08 16:45:48,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:47" (1/1) ... [2024-11-08 16:45:48,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:47" (1/1) ... [2024-11-08 16:45:48,184 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:47" (1/1) ... [2024-11-08 16:45:48,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:45:48,205 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:45:48,205 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:45:48,206 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:45:48,207 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:47" (1/1) ... [2024-11-08 16:45:48,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:45:48,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:45:48,248 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:45:48,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:45:48,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:45:48,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-08 16:45:48,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-08 16:45:48,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-08 16:45:48,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-08 16:45:48,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-08 16:45:48,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-08 16:45:48,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-08 16:45:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-11-08 16:45:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-11-08 16:45:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-11-08 16:45:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-11-08 16:45:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-11-08 16:45:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2024-11-08 16:45:48,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2024-11-08 16:45:48,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2024-11-08 16:45:48,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#15 [2024-11-08 16:45:48,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-08 16:45:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-08 16:45:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-08 16:45:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-08 16:45:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-08 16:45:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-08 16:45:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-08 16:45:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-11-08 16:45:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-11-08 16:45:48,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-11-08 16:45:48,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-11-08 16:45:48,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-11-08 16:45:48,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2024-11-08 16:45:48,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2024-11-08 16:45:48,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2024-11-08 16:45:48,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#15 [2024-11-08 16:45:48,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 16:45:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 16:45:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-08 16:45:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-08 16:45:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-08 16:45:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-08 16:45:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-08 16:45:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-08 16:45:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-08 16:45:48,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-08 16:45:48,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-08 16:45:48,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-08 16:45:48,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-08 16:45:48,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-08 16:45:48,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-11-08 16:45:48,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2024-11-08 16:45:48,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-08 16:45:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-08 16:45:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-08 16:45:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-08 16:45:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-08 16:45:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-08 16:45:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-08 16:45:48,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-08 16:45:48,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-08 16:45:48,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-08 16:45:48,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-08 16:45:48,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-08 16:45:48,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-08 16:45:48,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-11-08 16:45:48,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-11-08 16:45:48,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2024-11-08 16:45:48,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 16:45:48,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 16:45:48,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 16:45:48,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-08 16:45:48,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-08 16:45:48,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-08 16:45:48,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-08 16:45:48,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-08 16:45:48,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-08 16:45:48,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-08 16:45:48,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-08 16:45:48,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-08 16:45:48,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-08 16:45:48,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-08 16:45:48,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-11-08 16:45:48,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2024-11-08 16:45:48,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-08 16:45:48,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-08 16:45:48,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-08 16:45:48,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-08 16:45:48,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-08 16:45:48,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-08 16:45:48,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-08 16:45:48,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-08 16:45:48,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-08 16:45:48,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-08 16:45:48,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-08 16:45:48,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-08 16:45:48,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-08 16:45:48,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-11-08 16:45:48,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2024-11-08 16:45:48,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2024-11-08 16:45:48,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-08 16:45:48,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-08 16:45:48,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-08 16:45:48,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-08 16:45:48,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-08 16:45:48,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-08 16:45:48,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-08 16:45:48,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-11-08 16:45:48,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-11-08 16:45:48,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-11-08 16:45:48,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-11-08 16:45:48,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-11-08 16:45:48,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2024-11-08 16:45:48,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2024-11-08 16:45:48,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2024-11-08 16:45:48,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#15 [2024-11-08 16:45:48,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 16:45:48,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 16:45:48,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-08 16:45:48,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-08 16:45:48,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-08 16:45:48,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-08 16:45:48,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-08 16:45:48,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-08 16:45:48,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-08 16:45:48,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-08 16:45:48,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-08 16:45:48,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-08 16:45:48,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-11-08 16:45:48,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-11-08 16:45:48,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2024-11-08 16:45:48,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2024-11-08 16:45:48,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-08 16:45:48,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-08 16:45:48,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-08 16:45:48,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-08 16:45:48,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-08 16:45:48,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-08 16:45:48,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-08 16:45:48,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-08 16:45:48,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-08 16:45:48,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-08 16:45:48,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-11-08 16:45:48,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-11-08 16:45:48,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-11-08 16:45:48,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-11-08 16:45:48,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2024-11-08 16:45:48,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2024-11-08 16:45:48,332 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:45:48,332 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:45:48,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:45:48,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:45:48,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 16:45:48,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 16:45:48,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-08 16:45:48,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-08 16:45:48,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-08 16:45:48,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-08 16:45:48,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-08 16:45:48,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-08 16:45:48,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-08 16:45:48,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-08 16:45:48,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-08 16:45:48,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-08 16:45:48,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-08 16:45:48,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-08 16:45:48,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-11-08 16:45:48,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2024-11-08 16:45:48,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-08 16:45:48,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-08 16:45:48,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-08 16:45:48,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-08 16:45:48,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-08 16:45:48,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-08 16:45:48,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-08 16:45:48,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-08 16:45:48,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-08 16:45:48,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-08 16:45:48,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-11-08 16:45:48,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-11-08 16:45:48,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-11-08 16:45:48,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-11-08 16:45:48,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2024-11-08 16:45:48,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2024-11-08 16:45:48,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 16:45:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 16:45:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-08 16:45:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-08 16:45:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-08 16:45:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-08 16:45:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-08 16:45:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-08 16:45:48,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-08 16:45:48,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-08 16:45:48,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-08 16:45:48,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-08 16:45:48,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-11-08 16:45:48,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-11-08 16:45:48,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2024-11-08 16:45:48,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2024-11-08 16:45:48,718 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:45:48,721 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:45:49,996 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-11-08 16:45:49,996 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:45:50,011 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:45:50,012 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:45:50,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:45:50 BoogieIcfgContainer [2024-11-08 16:45:50,012 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:45:50,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:45:50,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:45:50,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:45:50,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:45:47" (1/3) ... [2024-11-08 16:45:50,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273fe16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:45:50, skipping insertion in model container [2024-11-08 16:45:50,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:47" (2/3) ... [2024-11-08 16:45:50,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273fe16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:45:50, skipping insertion in model container [2024-11-08 16:45:50,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:45:50" (3/3) ... [2024-11-08 16:45:50,023 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-53.i [2024-11-08 16:45:50,044 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:45:50,045 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:45:50,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:45:50,140 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@52712c69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:45:50,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:45:50,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 92 states have internal predecessors, (128), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:45:50,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 16:45:50,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:50,169 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:50,169 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:50,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:50,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1912926115, now seen corresponding path program 1 times [2024-11-08 16:45:50,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:45:50,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26187177] [2024-11-08 16:45:50,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:50,195 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:50,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:45:50,198 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:45:50,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 16:45:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:50,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 16:45:50,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:45:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-08 16:45:50,917 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:45:50,918 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:45:50,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26187177] [2024-11-08 16:45:50,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26187177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:50,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:50,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:45:50,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384819067] [2024-11-08 16:45:50,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:50,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:45:50,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:45:50,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:45:50,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:45:50,966 INFO L87 Difference]: Start difference. First operand has 112 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 92 states have internal predecessors, (128), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 16:45:51,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:51,013 INFO L93 Difference]: Finished difference Result 217 states and 340 transitions. [2024-11-08 16:45:51,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:45:51,016 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2024-11-08 16:45:51,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:51,030 INFO L225 Difference]: With dead ends: 217 [2024-11-08 16:45:51,030 INFO L226 Difference]: Without dead ends: 108 [2024-11-08 16:45:51,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 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-08 16:45:51,042 INFO L432 NwaCegarLoop]: 155 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, 155 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-08 16:45:51,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:45:51,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-08 16:45:51,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-08 16:45:51,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:45:51,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2024-11-08 16:45:51,108 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 140 [2024-11-08 16:45:51,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:51,110 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2024-11-08 16:45:51,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 16:45:51,110 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2024-11-08 16:45:51,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 16:45:51,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:51,114 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:51,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 16:45:51,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:51,315 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:51,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:51,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1070900733, now seen corresponding path program 1 times [2024-11-08 16:45:51,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:45:51,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193306333] [2024-11-08 16:45:51,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:51,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:51,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:45:51,321 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:45:51,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 16:45:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:51,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:45:51,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:45:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-08 16:45:51,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:45:51,997 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:45:51,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193306333] [2024-11-08 16:45:51,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193306333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:51,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:51,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:45:51,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031683374] [2024-11-08 16:45:51,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:52,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:45:52,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:45:52,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:45:52,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:45:52,002 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 16:45:52,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:52,086 INFO L93 Difference]: Finished difference Result 215 states and 310 transitions. [2024-11-08 16:45:52,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:45:52,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2024-11-08 16:45:52,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:52,089 INFO L225 Difference]: With dead ends: 215 [2024-11-08 16:45:52,089 INFO L226 Difference]: Without dead ends: 110 [2024-11-08 16:45:52,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 137 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-08 16:45:52,092 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:52,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:45:52,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-08 16:45:52,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-08 16:45:52,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:45:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 157 transitions. [2024-11-08 16:45:52,109 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 157 transitions. Word has length 140 [2024-11-08 16:45:52,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:52,111 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 157 transitions. [2024-11-08 16:45:52,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 16:45:52,111 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 157 transitions. [2024-11-08 16:45:52,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 16:45:52,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:52,121 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:52,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 16:45:52,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:52,322 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:52,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:52,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1909934395, now seen corresponding path program 1 times [2024-11-08 16:45:52,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:45:52,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574695858] [2024-11-08 16:45:52,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:52,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:52,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:45:52,328 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:45:52,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 16:45:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:52,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 16:45:52,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:45:53,618 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-08 16:45:53,645 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:45:53,645 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:45:53,646 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:45:53,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574695858] [2024-11-08 16:45:53,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574695858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:53,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:53,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:45:53,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363529943] [2024-11-08 16:45:53,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:53,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:45:53,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:45:53,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:45:53,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:45:53,649 INFO L87 Difference]: Start difference. First operand 110 states and 157 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:45:53,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:53,801 INFO L93 Difference]: Finished difference Result 324 states and 465 transitions. [2024-11-08 16:45:53,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:45:53,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-11-08 16:45:53,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:53,805 INFO L225 Difference]: With dead ends: 324 [2024-11-08 16:45:53,805 INFO L226 Difference]: Without dead ends: 217 [2024-11-08 16:45:53,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 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-08 16:45:53,807 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 81 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:53,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 428 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:45:53,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-08 16:45:53,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 213. [2024-11-08 16:45:53,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 174 states have (on average 1.3505747126436782) internal successors, (235), 174 states have internal predecessors, (235), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:45:53,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 307 transitions. [2024-11-08 16:45:53,856 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 307 transitions. Word has length 140 [2024-11-08 16:45:53,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:53,857 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 307 transitions. [2024-11-08 16:45:53,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:45:53,857 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 307 transitions. [2024-11-08 16:45:53,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 16:45:53,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:53,864 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:53,877 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 16:45:54,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:54,065 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:54,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:54,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1363964547, now seen corresponding path program 1 times [2024-11-08 16:45:54,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:45:54,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235003652] [2024-11-08 16:45:54,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:54,068 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:45:54,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:45:54,076 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:45:54,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 16:45:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:54,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 16:45:54,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:45:56,226 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-08 16:45:56,286 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 20 proven. 222 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-08 16:45:56,287 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:45:56,656 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:45:56,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235003652] [2024-11-08 16:45:56,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235003652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:45:56,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103078196] [2024-11-08 16:45:56,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:56,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:45:56,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:45:56,659 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:45:56,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 16:45:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 16:45:57,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:45:58,138 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 15 treesize of output 7 [2024-11-08 16:45:58,223 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 15 proven. 173 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-08 16:45:58,225 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:45:58,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103078196] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:45:58,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:45:58,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2024-11-08 16:45:58,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249573665] [2024-11-08 16:45:58,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:45:58,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 16:45:58,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:45:58,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 16:45:58,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2024-11-08 16:45:58,440 INFO L87 Difference]: Start difference. First operand 213 states and 307 transitions. Second operand has 21 states, 18 states have (on average 5.555555555555555) internal successors, (100), 19 states have internal predecessors, (100), 6 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) [2024-11-08 16:46:00,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:00,918 INFO L93 Difference]: Finished difference Result 445 states and 631 transitions. [2024-11-08 16:46:00,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 16:46:00,923 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 5.555555555555555) internal successors, (100), 19 states have internal predecessors, (100), 6 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) Word has length 140 [2024-11-08 16:46:00,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:00,928 INFO L225 Difference]: With dead ends: 445 [2024-11-08 16:46:00,930 INFO L226 Difference]: Without dead ends: 235 [2024-11-08 16:46:00,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 300 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=215, Invalid=1117, Unknown=0, NotChecked=0, Total=1332 [2024-11-08 16:46:00,936 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 321 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:00,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1312 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 16:46:00,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-08 16:46:00,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 231. [2024-11-08 16:46:00,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 188 states have (on average 1.324468085106383) internal successors, (249), 188 states have internal predecessors, (249), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:46:00,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 321 transitions. [2024-11-08 16:46:00,984 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 321 transitions. Word has length 140 [2024-11-08 16:46:00,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:00,985 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 321 transitions. [2024-11-08 16:46:00,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 5.555555555555555) internal successors, (100), 19 states have internal predecessors, (100), 6 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) [2024-11-08 16:46:00,985 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 321 transitions. [2024-11-08 16:46:00,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 16:46:00,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:00,988 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:00,997 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 16:46:01,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 16:46:01,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:46:01,390 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:01,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:01,391 INFO L85 PathProgramCache]: Analyzing trace with hash 352847297, now seen corresponding path program 1 times [2024-11-08 16:46:01,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:46:01,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391226881] [2024-11-08 16:46:01,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:01,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:01,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:46:01,396 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:46:01,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 16:46:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:01,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 16:46:01,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:03,417 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-08 16:46:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 16 proven. 116 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:46:03,486 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:46:03,696 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:46:03,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391226881] [2024-11-08 16:46:03,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391226881] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:46:03,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236753856] [2024-11-08 16:46:03,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:03,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:46:03,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:46:03,700 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:46:03,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 16:46:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 16:46:04,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:04,770 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 15 treesize of output 7 [2024-11-08 16:46:04,825 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 17 proven. 51 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:46:04,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:46:04,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236753856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:46:04,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:46:04,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2024-11-08 16:46:04,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120944572] [2024-11-08 16:46:04,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:46:04,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 16:46:04,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:46:04,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 16:46:04,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2024-11-08 16:46:04,941 INFO L87 Difference]: Start difference. First operand 231 states and 321 transitions. Second operand has 21 states, 18 states have (on average 5.5) internal successors, (99), 19 states have internal predecessors, (99), 5 states have call successors, (36), 4 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 5 states have call successors, (36) [2024-11-08 16:46:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:07,195 INFO L93 Difference]: Finished difference Result 479 states and 655 transitions. [2024-11-08 16:46:07,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 16:46:07,196 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 5.5) internal successors, (99), 19 states have internal predecessors, (99), 5 states have call successors, (36), 4 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 5 states have call successors, (36) Word has length 140 [2024-11-08 16:46:07,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:07,198 INFO L225 Difference]: With dead ends: 479 [2024-11-08 16:46:07,198 INFO L226 Difference]: Without dead ends: 251 [2024-11-08 16:46:07,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 300 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=215, Invalid=1117, Unknown=0, NotChecked=0, Total=1332 [2024-11-08 16:46:07,201 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 312 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:07,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1227 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 16:46:07,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-08 16:46:07,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 245. [2024-11-08 16:46:07,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 198 states have (on average 1.297979797979798) internal successors, (257), 198 states have internal predecessors, (257), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:46:07,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 329 transitions. [2024-11-08 16:46:07,245 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 329 transitions. Word has length 140 [2024-11-08 16:46:07,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:07,246 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 329 transitions. [2024-11-08 16:46:07,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 5.5) internal successors, (99), 19 states have internal predecessors, (99), 5 states have call successors, (36), 4 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 5 states have call successors, (36) [2024-11-08 16:46:07,246 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 329 transitions. [2024-11-08 16:46:07,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 16:46:07,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:07,249 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:07,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-08 16:46:07,475 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 16:46:07,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:46:07,650 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:07,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:07,651 INFO L85 PathProgramCache]: Analyzing trace with hash -153259004, now seen corresponding path program 1 times [2024-11-08 16:46:07,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:46:07,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368330519] [2024-11-08 16:46:07,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:07,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:07,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:46:07,653 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:46:07,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-08 16:46:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:08,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 16:46:08,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:08,819 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 17 treesize of output 13 [2024-11-08 16:46:08,986 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 51 treesize of output 39 [2024-11-08 16:46:08,992 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 51 treesize of output 31 [2024-11-08 16:46:09,045 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 10 proven. 338 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:46:09,045 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:46:09,270 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:46:09,270 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:46:09,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368330519] [2024-11-08 16:46:09,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368330519] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 16:46:09,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:46:09,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-08 16:46:09,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640691904] [2024-11-08 16:46:09,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:09,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:46:09,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:46:09,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:46:09,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:46:09,273 INFO L87 Difference]: Start difference. First operand 245 states and 329 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:46:09,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:09,474 INFO L93 Difference]: Finished difference Result 499 states and 667 transitions. [2024-11-08 16:46:09,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:46:09,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-11-08 16:46:09,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:09,477 INFO L225 Difference]: With dead ends: 499 [2024-11-08 16:46:09,477 INFO L226 Difference]: Without dead ends: 257 [2024-11-08 16:46:09,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:46:09,479 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 91 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:09,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 476 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:46:09,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-08 16:46:09,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2024-11-08 16:46:09,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 208 states have (on average 1.2836538461538463) internal successors, (267), 208 states have internal predecessors, (267), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:46:09,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 339 transitions. [2024-11-08 16:46:09,520 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 339 transitions. Word has length 141 [2024-11-08 16:46:09,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:09,521 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 339 transitions. [2024-11-08 16:46:09,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:46:09,521 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 339 transitions. [2024-11-08 16:46:09,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 16:46:09,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:09,523 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:09,534 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-08 16:46:09,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:09,724 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:09,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:09,726 INFO L85 PathProgramCache]: Analyzing trace with hash 547805574, now seen corresponding path program 1 times [2024-11-08 16:46:09,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:46:09,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576994925] [2024-11-08 16:46:09,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:09,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:09,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:46:09,730 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:46:09,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-08 16:46:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:10,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 16:46:10,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:15,196 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 38 treesize of output 34 [2024-11-08 16:46:15,733 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 230 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 16:46:15,733 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:46:16,117 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:46:16,117 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:46:16,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576994925] [2024-11-08 16:46:16,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576994925] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 16:46:16,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:46:16,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [22] total 24 [2024-11-08 16:46:16,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091436109] [2024-11-08 16:46:16,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:16,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:46:16,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:46:16,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:46:16,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2024-11-08 16:46:16,123 INFO L87 Difference]: Start difference. First operand 257 states and 339 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:46:16,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:16,480 INFO L93 Difference]: Finished difference Result 509 states and 671 transitions. [2024-11-08 16:46:16,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:46:16,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-11-08 16:46:16,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:16,484 INFO L225 Difference]: With dead ends: 509 [2024-11-08 16:46:16,484 INFO L226 Difference]: Without dead ends: 255 [2024-11-08 16:46:16,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2024-11-08 16:46:16,489 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 58 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:16,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 351 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:46:16,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-08 16:46:16,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2024-11-08 16:46:16,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 204 states have (on average 1.2696078431372548) internal successors, (259), 204 states have internal predecessors, (259), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:46:16,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 331 transitions. [2024-11-08 16:46:16,526 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 331 transitions. Word has length 141 [2024-11-08 16:46:16,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:16,526 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 331 transitions. [2024-11-08 16:46:16,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:46:16,531 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 331 transitions. [2024-11-08 16:46:16,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:46:16,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:16,535 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:16,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-08 16:46:16,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:16,736 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:16,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:16,736 INFO L85 PathProgramCache]: Analyzing trace with hash 564442593, now seen corresponding path program 1 times [2024-11-08 16:46:16,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:46:16,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300853676] [2024-11-08 16:46:16,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:16,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:16,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:46:16,738 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:46:16,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-08 16:46:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:17,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 16:46:17,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:17,644 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-08 16:46:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:46:17,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:46:17,659 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:46:17,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300853676] [2024-11-08 16:46:17,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300853676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:46:17,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:46:17,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:46:17,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969199127] [2024-11-08 16:46:17,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:17,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:46:17,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:46:17,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:46:17,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:46:17,661 INFO L87 Difference]: Start difference. First operand 253 states and 331 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:46:17,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:17,793 INFO L93 Difference]: Finished difference Result 507 states and 662 transitions. [2024-11-08 16:46:17,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:46:17,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2024-11-08 16:46:17,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:17,797 INFO L225 Difference]: With dead ends: 507 [2024-11-08 16:46:17,797 INFO L226 Difference]: Without dead ends: 257 [2024-11-08 16:46:17,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 143 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-08 16:46:17,798 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 68 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:17,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 421 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:46:17,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-08 16:46:17,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 253. [2024-11-08 16:46:17,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 204 states have (on average 1.2647058823529411) internal successors, (258), 204 states have internal predecessors, (258), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:46:17,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 330 transitions. [2024-11-08 16:46:17,826 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 330 transitions. Word has length 146 [2024-11-08 16:46:17,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:17,827 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 330 transitions. [2024-11-08 16:46:17,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:46:17,828 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 330 transitions. [2024-11-08 16:46:17,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:46:17,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:17,830 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:17,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-08 16:46:18,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:18,034 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:18,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:18,034 INFO L85 PathProgramCache]: Analyzing trace with hash -22363421, now seen corresponding path program 1 times [2024-11-08 16:46:18,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:46:18,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401850663] [2024-11-08 16:46:18,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:18,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:18,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:46:18,036 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:46:18,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-08 16:46:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:18,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 16:46:18,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:18,597 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 24 treesize of output 16 [2024-11-08 16:46:18,654 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-08 16:46:18,692 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:46:18,692 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:46:18,692 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:46:18,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401850663] [2024-11-08 16:46:18,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401850663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:46:18,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:46:18,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:46:18,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849386127] [2024-11-08 16:46:18,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:18,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:46:18,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:46:18,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:46:18,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:46:18,695 INFO L87 Difference]: Start difference. First operand 253 states and 330 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:46:19,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:19,214 INFO L93 Difference]: Finished difference Result 613 states and 801 transitions. [2024-11-08 16:46:19,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:46:19,215 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2024-11-08 16:46:19,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:19,218 INFO L225 Difference]: With dead ends: 613 [2024-11-08 16:46:19,218 INFO L226 Difference]: Without dead ends: 363 [2024-11-08 16:46:19,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:46:19,219 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 67 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:19,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 778 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:46:19,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-08 16:46:19,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 281. [2024-11-08 16:46:19,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 232 states have (on average 1.2801724137931034) internal successors, (297), 232 states have internal predecessors, (297), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:46:19,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 369 transitions. [2024-11-08 16:46:19,251 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 369 transitions. Word has length 146 [2024-11-08 16:46:19,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:19,252 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 369 transitions. [2024-11-08 16:46:19,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:46:19,252 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 369 transitions. [2024-11-08 16:46:19,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:46:19,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:19,254 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:19,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-08 16:46:19,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:19,455 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:19,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:19,455 INFO L85 PathProgramCache]: Analyzing trace with hash 678701157, now seen corresponding path program 1 times [2024-11-08 16:46:19,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:46:19,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51656851] [2024-11-08 16:46:19,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:19,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:19,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:46:19,457 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:46:19,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-08 16:46:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:19,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 16:46:19,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:21,145 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-08 16:46:21,191 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 16 proven. 116 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:46:21,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:46:21,369 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:46:21,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51656851] [2024-11-08 16:46:21,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51656851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:46:21,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487626381] [2024-11-08 16:46:21,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:21,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:46:21,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:46:21,371 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:46:21,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 16:46:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:21,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 16:46:21,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:22,221 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 15 treesize of output 7 [2024-11-08 16:46:22,271 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 17 proven. 51 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:46:22,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:46:22,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487626381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:46:22,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:46:22,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 [2024-11-08 16:46:22,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435284809] [2024-11-08 16:46:22,446 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:46:22,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 16:46:22,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:46:22,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 16:46:22,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2024-11-08 16:46:22,448 INFO L87 Difference]: Start difference. First operand 281 states and 369 transitions. Second operand has 19 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 5 states have call successors, (36), 4 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 5 states have call successors, (36) [2024-11-08 16:46:24,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:24,001 INFO L93 Difference]: Finished difference Result 569 states and 747 transitions. [2024-11-08 16:46:24,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 16:46:24,002 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 5 states have call successors, (36), 4 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 5 states have call successors, (36) Word has length 146 [2024-11-08 16:46:24,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:24,004 INFO L225 Difference]: With dead ends: 569 [2024-11-08 16:46:24,004 INFO L226 Difference]: Without dead ends: 291 [2024-11-08 16:46:24,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=190, Invalid=866, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 16:46:24,006 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 296 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:24,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 875 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 16:46:24,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-08 16:46:24,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 281. [2024-11-08 16:46:24,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 232 states have (on average 1.2801724137931034) internal successors, (297), 232 states have internal predecessors, (297), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:46:24,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 369 transitions. [2024-11-08 16:46:24,039 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 369 transitions. Word has length 146 [2024-11-08 16:46:24,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:24,040 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 369 transitions. [2024-11-08 16:46:24,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 5 states have call successors, (36), 4 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 5 states have call successors, (36) [2024-11-08 16:46:24,040 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 369 transitions. [2024-11-08 16:46:24,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:46:24,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:24,042 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:24,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-08 16:46:24,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-08 16:46:24,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:46:24,443 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:24,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:24,443 INFO L85 PathProgramCache]: Analyzing trace with hash -840011871, now seen corresponding path program 1 times [2024-11-08 16:46:24,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:46:24,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403593032] [2024-11-08 16:46:24,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:24,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:24,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:46:24,447 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:46:24,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-08 16:46:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:24,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 16:46:24,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:26,097 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-08 16:46:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 20 proven. 222 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-08 16:46:26,160 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:46:26,358 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:46:26,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403593032] [2024-11-08 16:46:26,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403593032] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:46:26,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149289878] [2024-11-08 16:46:26,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:26,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:46:26,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:46:26,360 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:46:26,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-08 16:46:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:26,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 16:46:26,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:27,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 15 treesize of output 7 [2024-11-08 16:46:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 15 proven. 173 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-08 16:46:27,408 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:46:27,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149289878] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:46:27,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:46:27,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 [2024-11-08 16:46:27,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695215827] [2024-11-08 16:46:27,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:46:27,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 16:46:27,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:46:27,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 16:46:27,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2024-11-08 16:46:27,572 INFO L87 Difference]: Start difference. First operand 281 states and 369 transitions. Second operand has 19 states, 16 states have (on average 7.1875) internal successors, (115), 17 states have internal predecessors, (115), 6 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) [2024-11-08 16:46:29,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:29,263 INFO L93 Difference]: Finished difference Result 569 states and 745 transitions. [2024-11-08 16:46:29,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 16:46:29,264 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.1875) internal successors, (115), 17 states have internal predecessors, (115), 6 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) Word has length 146 [2024-11-08 16:46:29,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:29,266 INFO L225 Difference]: With dead ends: 569 [2024-11-08 16:46:29,266 INFO L226 Difference]: Without dead ends: 291 [2024-11-08 16:46:29,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=190, Invalid=866, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 16:46:29,268 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 265 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:29,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 955 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 16:46:29,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-08 16:46:29,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 253. [2024-11-08 16:46:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 204 states have (on average 1.2549019607843137) internal successors, (256), 204 states have internal predecessors, (256), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:46:29,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 328 transitions. [2024-11-08 16:46:29,299 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 328 transitions. Word has length 146 [2024-11-08 16:46:29,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:29,301 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 328 transitions. [2024-11-08 16:46:29,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.1875) internal successors, (115), 17 states have internal predecessors, (115), 6 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) [2024-11-08 16:46:29,301 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 328 transitions. [2024-11-08 16:46:29,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 16:46:29,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:29,305 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:29,316 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-08 16:46:29,524 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-08 16:46:29,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:46:29,705 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:29,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:29,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1510301857, now seen corresponding path program 1 times [2024-11-08 16:46:29,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:46:29,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699983878] [2024-11-08 16:46:29,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:29,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:29,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:46:29,710 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:46:29,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-08 16:46:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:30,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 16:46:30,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:30,366 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:46:30,366 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:46:30,366 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:46:30,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699983878] [2024-11-08 16:46:30,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699983878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:46:30,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:46:30,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:46:30,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931934147] [2024-11-08 16:46:30,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:30,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:46:30,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:46:30,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:46:30,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:46:30,368 INFO L87 Difference]: Start difference. First operand 253 states and 328 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:46:30,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:30,469 INFO L93 Difference]: Finished difference Result 511 states and 663 transitions. [2024-11-08 16:46:30,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:46:30,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2024-11-08 16:46:30,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:30,472 INFO L225 Difference]: With dead ends: 511 [2024-11-08 16:46:30,472 INFO L226 Difference]: Without dead ends: 261 [2024-11-08 16:46:30,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:46:30,474 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:30,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 716 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:46:30,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-08 16:46:30,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2024-11-08 16:46:30,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 212 states have (on average 1.2452830188679245) internal successors, (264), 212 states have internal predecessors, (264), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:46:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 336 transitions. [2024-11-08 16:46:30,502 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 336 transitions. Word has length 148 [2024-11-08 16:46:30,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:30,504 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 336 transitions. [2024-11-08 16:46:30,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:46:30,504 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 336 transitions. [2024-11-08 16:46:30,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 16:46:30,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:30,505 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:30,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-08 16:46:30,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:30,710 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:30,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:30,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2038602513, now seen corresponding path program 1 times [2024-11-08 16:46:30,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:46:30,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601773969] [2024-11-08 16:46:30,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:30,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:30,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:46:30,712 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:46:30,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-08 16:46:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:31,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 16:46:31,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:31,243 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:46:31,243 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:46:31,244 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:46:31,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601773969] [2024-11-08 16:46:31,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601773969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:46:31,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:46:31,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:46:31,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571381609] [2024-11-08 16:46:31,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:31,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:46:31,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:46:31,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:46:31,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:46:31,246 INFO L87 Difference]: Start difference. First operand 261 states and 336 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:46:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:31,325 INFO L93 Difference]: Finished difference Result 525 states and 677 transitions. [2024-11-08 16:46:31,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:46:31,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 150 [2024-11-08 16:46:31,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:31,328 INFO L225 Difference]: With dead ends: 525 [2024-11-08 16:46:31,328 INFO L226 Difference]: Without dead ends: 267 [2024-11-08 16:46:31,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:46:31,330 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:31,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 576 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:46:31,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-08 16:46:31,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-11-08 16:46:31,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 218 states have (on average 1.238532110091743) internal successors, (270), 218 states have internal predecessors, (270), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:46:31,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 342 transitions. [2024-11-08 16:46:31,366 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 342 transitions. Word has length 150 [2024-11-08 16:46:31,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:31,366 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 342 transitions. [2024-11-08 16:46:31,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:46:31,367 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 342 transitions. [2024-11-08 16:46:31,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 16:46:31,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:31,368 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:31,382 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-08 16:46:31,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:31,569 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:31,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:31,569 INFO L85 PathProgramCache]: Analyzing trace with hash -639774038, now seen corresponding path program 1 times [2024-11-08 16:46:31,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:46:31,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398068355] [2024-11-08 16:46:31,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:31,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:31,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:46:31,574 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:46:31,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-08 16:46:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:32,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 16:46:32,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:46:32,122 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:46:32,122 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:46:32,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398068355] [2024-11-08 16:46:32,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398068355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:46:32,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:46:32,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:46:32,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445105263] [2024-11-08 16:46:32,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:32,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:46:32,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:46:32,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:46:32,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:46:32,124 INFO L87 Difference]: Start difference. First operand 267 states and 342 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:46:32,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:32,247 INFO L93 Difference]: Finished difference Result 541 states and 693 transitions. [2024-11-08 16:46:32,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:46:32,248 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 150 [2024-11-08 16:46:32,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:32,250 INFO L225 Difference]: With dead ends: 541 [2024-11-08 16:46:32,250 INFO L226 Difference]: Without dead ends: 277 [2024-11-08 16:46:32,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:46:32,252 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:32,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 853 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:46:32,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-08 16:46:32,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 269. [2024-11-08 16:46:32,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 220 states have (on average 1.2363636363636363) internal successors, (272), 220 states have internal predecessors, (272), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:46:32,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 344 transitions. [2024-11-08 16:46:32,281 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 344 transitions. Word has length 150 [2024-11-08 16:46:32,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:32,282 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 344 transitions. [2024-11-08 16:46:32,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:46:32,282 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 344 transitions. [2024-11-08 16:46:32,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 16:46:32,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:32,284 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:32,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-08 16:46:32,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:32,484 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:32,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:32,485 INFO L85 PathProgramCache]: Analyzing trace with hash -280005512, now seen corresponding path program 1 times [2024-11-08 16:46:32,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:46:32,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120684234] [2024-11-08 16:46:32,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:32,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:32,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:46:32,489 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:46:32,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-08 16:46:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:33,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 16:46:33,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:36,902 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 15 treesize of output 7 [2024-11-08 16:46:36,910 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 15 treesize of output 7 [2024-11-08 16:46:36,919 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-08 16:46:37,000 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 488 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-08 16:46:37,000 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:46:37,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:46:37,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2024-11-08 16:46:38,049 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:46:38,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120684234] [2024-11-08 16:46:38,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120684234] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:46:38,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285537551] [2024-11-08 16:46:38,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:38,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:46:38,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:46:38,050 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:46:38,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-08 16:46:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:38,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 16:46:38,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:42,394 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 15 treesize of output 7 [2024-11-08 16:46:42,401 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 15 treesize of output 7 [2024-11-08 16:46:42,408 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 15 treesize of output 7 [2024-11-08 16:46:42,531 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 488 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-08 16:46:42,531 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:46:42,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:46:42,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2024-11-08 16:46:43,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285537551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:46:43,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:46:43,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 38 [2024-11-08 16:46:43,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035448645] [2024-11-08 16:46:43,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:46:43,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-08 16:46:43,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:46:43,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-08 16:46:43,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1784, Unknown=0, NotChecked=0, Total=1980 [2024-11-08 16:46:43,100 INFO L87 Difference]: Start difference. First operand 269 states and 344 transitions. Second operand has 39 states, 32 states have (on average 4.03125) internal successors, (129), 31 states have internal predecessors, (129), 14 states have call successors, (34), 13 states have call predecessors, (34), 14 states have return successors, (34), 8 states have call predecessors, (34), 14 states have call successors, (34) [2024-11-08 16:46:48,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:48,225 INFO L93 Difference]: Finished difference Result 500 states and 630 transitions. [2024-11-08 16:46:48,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-08 16:46:48,226 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 32 states have (on average 4.03125) internal successors, (129), 31 states have internal predecessors, (129), 14 states have call successors, (34), 13 states have call predecessors, (34), 14 states have return successors, (34), 8 states have call predecessors, (34), 14 states have call successors, (34) Word has length 152 [2024-11-08 16:46:48,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:48,229 INFO L225 Difference]: With dead ends: 500 [2024-11-08 16:46:48,229 INFO L226 Difference]: Without dead ends: 234 [2024-11-08 16:46:48,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1204 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=677, Invalid=3745, Unknown=0, NotChecked=0, Total=4422 [2024-11-08 16:46:48,233 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 782 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:48,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 1810 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 16:46:48,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-08 16:46:48,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 142. [2024-11-08 16:46:48,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 116 states have (on average 1.2241379310344827) internal successors, (142), 116 states have internal predecessors, (142), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:46:48,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 178 transitions. [2024-11-08 16:46:48,262 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 178 transitions. Word has length 152 [2024-11-08 16:46:48,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:48,263 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 178 transitions. [2024-11-08 16:46:48,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 32 states have (on average 4.03125) internal successors, (129), 31 states have internal predecessors, (129), 14 states have call successors, (34), 13 states have call predecessors, (34), 14 states have return successors, (34), 8 states have call predecessors, (34), 14 states have call successors, (34) [2024-11-08 16:46:48,264 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2024-11-08 16:46:48,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 16:46:48,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:48,265 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:48,292 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-08 16:46:48,489 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-08 16:46:48,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:48,666 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:48,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:48,667 INFO L85 PathProgramCache]: Analyzing trace with hash 32824095, now seen corresponding path program 1 times [2024-11-08 16:46:48,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:46:48,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333271606] [2024-11-08 16:46:48,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:48,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:48,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:46:48,671 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:46:48,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-08 16:46:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:49,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:46:49,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:49,242 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 17 treesize of output 9 [2024-11-08 16:46:49,260 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:46:49,260 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:46:49,261 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:46:49,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333271606] [2024-11-08 16:46:49,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333271606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:46:49,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:46:49,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:46:49,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785765600] [2024-11-08 16:46:49,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:49,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:46:49,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:46:49,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:46:49,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:46:49,263 INFO L87 Difference]: Start difference. First operand 142 states and 178 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:46:49,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:49,316 INFO L93 Difference]: Finished difference Result 281 states and 353 transitions. [2024-11-08 16:46:49,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:46:49,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 154 [2024-11-08 16:46:49,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:49,319 INFO L225 Difference]: With dead ends: 281 [2024-11-08 16:46:49,319 INFO L226 Difference]: Without dead ends: 142 [2024-11-08 16:46:49,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 152 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-08 16:46:49,321 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:49,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 292 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:46:49,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-08 16:46:49,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-08 16:46:49,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 116 states have (on average 1.2155172413793103) internal successors, (141), 116 states have internal predecessors, (141), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:46:49,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 177 transitions. [2024-11-08 16:46:49,348 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 177 transitions. Word has length 154 [2024-11-08 16:46:49,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:49,348 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 177 transitions. [2024-11-08 16:46:49,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:46:49,349 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 177 transitions. [2024-11-08 16:46:49,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 16:46:49,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:49,350 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:49,363 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-08 16:46:49,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:49,551 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:49,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:49,552 INFO L85 PathProgramCache]: Analyzing trace with hash -476648995, now seen corresponding path program 1 times [2024-11-08 16:46:49,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:46:49,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2046353391] [2024-11-08 16:46:49,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:49,553 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:49,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:46:49,556 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:46:49,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-08 16:46:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:50,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:46:50,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:50,217 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 17 treesize of output 9 [2024-11-08 16:46:50,240 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:46:50,240 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:46:50,240 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:46:50,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2046353391] [2024-11-08 16:46:50,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2046353391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:46:50,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:46:50,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:46:50,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091590798] [2024-11-08 16:46:50,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:50,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:46:50,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:46:50,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:46:50,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:46:50,243 INFO L87 Difference]: Start difference. First operand 142 states and 177 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:46:50,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:50,283 INFO L93 Difference]: Finished difference Result 281 states and 351 transitions. [2024-11-08 16:46:50,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:46:50,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 154 [2024-11-08 16:46:50,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:50,286 INFO L225 Difference]: With dead ends: 281 [2024-11-08 16:46:50,286 INFO L226 Difference]: Without dead ends: 142 [2024-11-08 16:46:50,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 152 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-08 16:46:50,288 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:50,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 290 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:46:50,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-08 16:46:50,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-08 16:46:50,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 116 states have (on average 1.206896551724138) internal successors, (140), 116 states have internal predecessors, (140), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:46:50,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 176 transitions. [2024-11-08 16:46:50,315 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 176 transitions. Word has length 154 [2024-11-08 16:46:50,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:50,315 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 176 transitions. [2024-11-08 16:46:50,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:46:50,316 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 176 transitions. [2024-11-08 16:46:50,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 16:46:50,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:50,317 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:50,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-08 16:46:50,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:50,518 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:50,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:50,518 INFO L85 PathProgramCache]: Analyzing trace with hash 2129374559, now seen corresponding path program 1 times [2024-11-08 16:46:50,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:46:50,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667877302] [2024-11-08 16:46:50,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:50,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:50,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:46:50,520 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:46:50,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-08 16:46:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:51,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 16:46:51,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:51,718 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 15 [2024-11-08 16:46:51,820 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 24 treesize of output 16 [2024-11-08 16:46:51,845 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 14 [2024-11-08 16:46:51,945 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2024-11-08 16:46:51,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:46:52,304 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:46:52,305 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:46:52,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667877302] [2024-11-08 16:46:52,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667877302] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 16:46:52,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:46:52,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 14 [2024-11-08 16:46:52,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190767418] [2024-11-08 16:46:52,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:52,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:46:52,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:46:52,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:46:52,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:46:52,306 INFO L87 Difference]: Start difference. First operand 142 states and 176 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:46:53,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:53,038 INFO L93 Difference]: Finished difference Result 353 states and 435 transitions. [2024-11-08 16:46:53,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:46:53,039 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 154 [2024-11-08 16:46:53,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:53,041 INFO L225 Difference]: With dead ends: 353 [2024-11-08 16:46:53,041 INFO L226 Difference]: Without dead ends: 214 [2024-11-08 16:46:53,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 293 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-08 16:46:53,043 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 110 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:53,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1365 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:46:53,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-08 16:46:53,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 210. [2024-11-08 16:46:53,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 163 states have (on average 1.1840490797546013) internal successors, (193), 164 states have internal predecessors, (193), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 16:46:53,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 257 transitions. [2024-11-08 16:46:53,095 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 257 transitions. Word has length 154 [2024-11-08 16:46:53,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:53,096 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 257 transitions. [2024-11-08 16:46:53,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:46:53,096 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 257 transitions. [2024-11-08 16:46:53,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 16:46:53,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:53,098 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:53,109 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-08 16:46:53,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:53,298 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:53,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:53,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1251027955, now seen corresponding path program 1 times [2024-11-08 16:46:53,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:46:53,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721374109] [2024-11-08 16:46:53,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:53,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:53,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:46:53,301 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:46:53,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-08 16:46:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:53,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 16:46:53,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:54,782 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 15 treesize of output 1 [2024-11-08 16:46:55,089 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 85 treesize of output 65 [2024-11-08 16:46:55,092 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 83 treesize of output 67 [2024-11-08 16:46:55,192 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 36 proven. 326 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-08 16:46:55,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:46:55,984 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:46:55,984 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:46:55,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721374109] [2024-11-08 16:46:55,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721374109] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 16:46:55,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:46:55,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2024-11-08 16:46:55,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713034360] [2024-11-08 16:46:55,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:55,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:46:55,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:46:55,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:46:55,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-11-08 16:46:55,986 INFO L87 Difference]: Start difference. First operand 210 states and 257 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:46:57,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:57,347 INFO L93 Difference]: Finished difference Result 326 states and 398 transitions. [2024-11-08 16:46:57,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:46:57,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 154 [2024-11-08 16:46:57,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:57,352 INFO L225 Difference]: With dead ends: 326 [2024-11-08 16:46:57,353 INFO L226 Difference]: Without dead ends: 324 [2024-11-08 16:46:57,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2024-11-08 16:46:57,354 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 91 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:57,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1079 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 16:46:57,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-08 16:46:57,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 321. [2024-11-08 16:46:57,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 258 states have (on average 1.2015503875968991) internal successors, (310), 260 states have internal predecessors, (310), 42 states have call successors, (42), 20 states have call predecessors, (42), 20 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:46:57,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 394 transitions. [2024-11-08 16:46:57,428 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 394 transitions. Word has length 154 [2024-11-08 16:46:57,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:57,429 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 394 transitions. [2024-11-08 16:46:57,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:46:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 394 transitions. [2024-11-08 16:46:57,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 16:46:57,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:57,431 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:57,440 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-11-08 16:46:57,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:57,631 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:57,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:57,632 INFO L85 PathProgramCache]: Analyzing trace with hash -623828481, now seen corresponding path program 1 times [2024-11-08 16:46:57,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:46:57,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432613785] [2024-11-08 16:46:57,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:57,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:46:57,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:46:57,634 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:46:57,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-08 16:46:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:58,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 16:46:58,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:58,791 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 27 treesize of output 19 [2024-11-08 16:46:58,795 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-08 16:46:59,019 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-08 16:46:59,058 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 10 proven. 338 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:46:59,058 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:46:59,550 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-08 16:46:59,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2024-11-08 16:46:59,754 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 16:46:59,755 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:46:59,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432613785] [2024-11-08 16:46:59,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1432613785] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:46:59,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:46:59,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2024-11-08 16:46:59,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395388179] [2024-11-08 16:46:59,756 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:46:59,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 16:46:59,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:46:59,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 16:46:59,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:46:59,758 INFO L87 Difference]: Start difference. First operand 321 states and 394 transitions. Second operand has 14 states, 12 states have (on average 8.5) internal successors, (102), 14 states have internal predecessors, (102), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2024-11-08 16:47:00,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:47:00,817 INFO L93 Difference]: Finished difference Result 578 states and 699 transitions. [2024-11-08 16:47:00,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 16:47:00,818 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.5) internal successors, (102), 14 states have internal predecessors, (102), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) Word has length 154 [2024-11-08 16:47:00,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:47:00,820 INFO L225 Difference]: With dead ends: 578 [2024-11-08 16:47:00,821 INFO L226 Difference]: Without dead ends: 325 [2024-11-08 16:47:00,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 295 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2024-11-08 16:47:00,822 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 418 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:47:00,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 493 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:47:00,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-08 16:47:00,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 311. [2024-11-08 16:47:00,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 245 states have (on average 1.1714285714285715) internal successors, (287), 247 states have internal predecessors, (287), 42 states have call successors, (42), 23 states have call predecessors, (42), 23 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:47:00,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 371 transitions. [2024-11-08 16:47:00,900 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 371 transitions. Word has length 154 [2024-11-08 16:47:00,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:47:00,901 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 371 transitions. [2024-11-08 16:47:00,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.5) internal successors, (102), 14 states have internal predecessors, (102), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2024-11-08 16:47:00,901 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 371 transitions. [2024-11-08 16:47:00,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 16:47:00,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:47:00,902 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:47:00,911 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-11-08 16:47:01,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:47:01,103 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:47:01,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:47:01,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1925126989, now seen corresponding path program 1 times [2024-11-08 16:47:01,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:47:01,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181888868] [2024-11-08 16:47:01,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:47:01,104 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:47:01,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:47:01,105 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:47:01,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-08 16:47:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:47:01,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 16:47:01,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:47:06,442 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-08 16:47:06,451 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 15 treesize of output 7 [2024-11-08 16:47:06,458 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 15 treesize of output 7 [2024-11-08 16:47:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 488 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-08 16:47:06,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:47:07,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:47:07,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2024-11-08 16:47:07,947 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:47:07,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181888868] [2024-11-08 16:47:07,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181888868] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:47:07,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247746465] [2024-11-08 16:47:07,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:47:07,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:47:07,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:47:07,949 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:47:07,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-08 16:47:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:47:08,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 16:47:08,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:47:12,265 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-08 16:47:12,277 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 15 treesize of output 7 [2024-11-08 16:47:12,286 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 15 treesize of output 7 [2024-11-08 16:47:12,296 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 488 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-08 16:47:12,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:47:12,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:47:12,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2024-11-08 16:47:12,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247746465] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:47:12,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:47:12,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2024-11-08 16:47:12,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215138686] [2024-11-08 16:47:12,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:47:12,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 16:47:12,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:47:12,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 16:47:12,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2024-11-08 16:47:12,988 INFO L87 Difference]: Start difference. First operand 311 states and 371 transitions. Second operand has 23 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 18 states have internal predecessors, (90), 8 states have call successors, (18), 7 states have call predecessors, (18), 8 states have return successors, (18), 5 states have call predecessors, (18), 8 states have call successors, (18) [2024-11-08 16:47:17,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:47:17,682 INFO L93 Difference]: Finished difference Result 564 states and 671 transitions. [2024-11-08 16:47:17,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-08 16:47:17,683 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 18 states have internal predecessors, (90), 8 states have call successors, (18), 7 states have call predecessors, (18), 8 states have return successors, (18), 5 states have call predecessors, (18), 8 states have call successors, (18) Word has length 156 [2024-11-08 16:47:17,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:47:17,685 INFO L225 Difference]: With dead ends: 564 [2024-11-08 16:47:17,685 INFO L226 Difference]: Without dead ends: 325 [2024-11-08 16:47:17,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 432 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=449, Invalid=2101, Unknown=0, NotChecked=0, Total=2550 [2024-11-08 16:47:17,688 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 420 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:47:17,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1256 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 16:47:17,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-08 16:47:17,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 311. [2024-11-08 16:47:17,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 245 states have (on average 1.163265306122449) internal successors, (285), 247 states have internal predecessors, (285), 42 states have call successors, (42), 23 states have call predecessors, (42), 23 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:47:17,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 369 transitions. [2024-11-08 16:47:17,776 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 369 transitions. Word has length 156 [2024-11-08 16:47:17,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:47:17,777 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 369 transitions. [2024-11-08 16:47:17,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 18 states have internal predecessors, (90), 8 states have call successors, (18), 7 states have call predecessors, (18), 8 states have return successors, (18), 5 states have call predecessors, (18), 8 states have call successors, (18) [2024-11-08 16:47:17,777 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 369 transitions. [2024-11-08 16:47:17,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 16:47:17,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:47:17,779 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:47:17,791 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-08 16:47:18,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2024-11-08 16:47:18,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:47:18,181 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:47:18,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:47:18,181 INFO L85 PathProgramCache]: Analyzing trace with hash -2077705356, now seen corresponding path program 1 times [2024-11-08 16:47:18,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:47:18,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433590035] [2024-11-08 16:47:18,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:47:18,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:47:18,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:47:18,183 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:47:18,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-11-08 16:47:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:47:27,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 16:47:27,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:47:55,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:47:55,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 100 [2024-11-08 16:47:55,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:47:55,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 70 [2024-11-08 16:48:00,266 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 356 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-08 16:48:00,266 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:48:40,281 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:48:40,281 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:48:40,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433590035] [2024-11-08 16:48:40,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433590035] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 16:48:40,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:48:40,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2024-11-08 16:48:40,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28576587] [2024-11-08 16:48:40,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:48:40,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:48:40,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:48:40,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:48:40,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-08 16:48:40,284 INFO L87 Difference]: Start difference. First operand 311 states and 369 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:48:43,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:48:44,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:48:48,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:48:50,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:48:51,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:48:52,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:48:56,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:49:00,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:49:01,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:49:03,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:49:13,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:49:17,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:49:19,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:49:21,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:49:40,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:49:42,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:49:43,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:49:44,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:49:46,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:49:48,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:49:50,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:49:51,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:49:52,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:49:52,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:49:52,495 INFO L93 Difference]: Finished difference Result 544 states and 645 transitions. [2024-11-08 16:49:52,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:49:52,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-08 16:49:52,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:49:52,516 INFO L225 Difference]: With dead ends: 544 [2024-11-08 16:49:52,516 INFO L226 Difference]: Without dead ends: 305 [2024-11-08 16:49:52,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 51.7s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:49:52,518 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 50 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:49:52,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 470 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 59.1s Time] [2024-11-08 16:49:52,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-08 16:49:52,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-11-08 16:49:52,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 239 states have (on average 1.1548117154811715) internal successors, (276), 241 states have internal predecessors, (276), 42 states have call successors, (42), 23 states have call predecessors, (42), 23 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:49:52,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 360 transitions. [2024-11-08 16:49:52,613 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 360 transitions. Word has length 158 [2024-11-08 16:49:52,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:49:52,613 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 360 transitions. [2024-11-08 16:49:52,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:49:52,614 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 360 transitions. [2024-11-08 16:49:52,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 16:49:52,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:49:52,615 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:49:52,640 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2024-11-08 16:49:52,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:49:52,821 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:49:52,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:49:52,821 INFO L85 PathProgramCache]: Analyzing trace with hash -340421356, now seen corresponding path program 1 times [2024-11-08 16:49:52,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:49:52,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284252591] [2024-11-08 16:49:52,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:49:52,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:49:52,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:49:52,826 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:49:52,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-11-08 16:50:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:50:15,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 16:50:15,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:51:17,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:17,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 241 treesize of output 121 [2024-11-08 16:51:17,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:17,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 211 treesize of output 91 [2024-11-08 16:51:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 356 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-08 16:51:24,263 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:52:10,256 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:52:10,256 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:52:10,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284252591] [2024-11-08 16:52:10,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284252591] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 16:52:10,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:52:10,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2024-11-08 16:52:10,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143113471] [2024-11-08 16:52:10,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:10,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:52:10,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:52:10,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:52:10,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-08 16:52:10,259 INFO L87 Difference]: Start difference. First operand 305 states and 360 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:52:11,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:52:16,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:52:18,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:52:23,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:52:27,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:52:31,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:52:32,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:52:34,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:52:38,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:52:39,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:53:00,825 WARN L286 SmtUtils]: Spent 5.38s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:53:03,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:53:04,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:53:11,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:53:14,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:53:18,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:53:19,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:53:23,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:53:24,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:53:24,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:53:24,931 INFO L93 Difference]: Finished difference Result 538 states and 635 transitions. [2024-11-08 16:53:24,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:53:24,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-08 16:53:24,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:53:24,951 INFO L225 Difference]: With dead ends: 538 [2024-11-08 16:53:24,951 INFO L226 Difference]: Without dead ends: 305 [2024-11-08 16:53:24,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 68.4s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:53:24,953 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 92 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:53:24,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 484 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 53.7s Time] [2024-11-08 16:53:24,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-08 16:53:25,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-11-08 16:53:25,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 239 states have (on average 1.1506276150627615) internal successors, (275), 241 states have internal predecessors, (275), 42 states have call successors, (42), 23 states have call predecessors, (42), 23 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:53:25,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 359 transitions. [2024-11-08 16:53:25,073 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 359 transitions. Word has length 158 [2024-11-08 16:53:25,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:53:25,074 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 359 transitions. [2024-11-08 16:53:25,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:53:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 359 transitions. [2024-11-08 16:53:25,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 16:53:25,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:53:25,076 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:53:25,102 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2024-11-08 16:53:25,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:25,277 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:53:25,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:25,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1550696494, now seen corresponding path program 1 times [2024-11-08 16:53:25,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:53:25,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334375281] [2024-11-08 16:53:25,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:53:25,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:25,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:53:25,283 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:53:25,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2024-11-08 16:53:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:26,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 16:53:26,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:53:28,454 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 12 treesize of output 8 [2024-11-08 16:53:29,055 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 17 treesize of output 9 [2024-11-08 16:53:29,171 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 26 [2024-11-08 16:53:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 68 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-08 16:53:29,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:53:31,315 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 26 treesize of output 22 [2024-11-08 16:53:31,326 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:53:31,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:53:31,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 38 [2024-11-08 16:53:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:53:31,855 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:53:31,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334375281] [2024-11-08 16:53:31,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334375281] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 16:53:31,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:53:31,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 27 [2024-11-08 16:53:31,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213178009] [2024-11-08 16:53:31,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:53:31,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:53:31,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:53:31,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:53:31,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2024-11-08 16:53:31,857 INFO L87 Difference]: Start difference. First operand 305 states and 359 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:53:35,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:53:35,074 INFO L93 Difference]: Finished difference Result 436 states and 511 transitions. [2024-11-08 16:53:35,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:53:35,075 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2024-11-08 16:53:35,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:53:35,077 INFO L225 Difference]: With dead ends: 436 [2024-11-08 16:53:35,078 INFO L226 Difference]: Without dead ends: 434 [2024-11-08 16:53:35,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 16:53:35,079 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 99 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:53:35,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1947 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 16:53:35,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-08 16:53:35,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2024-11-08 16:53:35,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 340 states have (on average 1.15) internal successors, (391), 343 states have internal predecessors, (391), 58 states have call successors, (58), 32 states have call predecessors, (58), 32 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-08 16:53:35,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 507 transitions. [2024-11-08 16:53:35,249 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 507 transitions. Word has length 160 [2024-11-08 16:53:35,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:53:35,249 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 507 transitions. [2024-11-08 16:53:35,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:53:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 507 transitions. [2024-11-08 16:53:35,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 16:53:35,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:53:35,252 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:53:35,270 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2024-11-08 16:53:35,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:35,453 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:53:35,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:35,454 INFO L85 PathProgramCache]: Analyzing trace with hash -969263440, now seen corresponding path program 1 times [2024-11-08 16:53:35,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:53:35,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418943182] [2024-11-08 16:53:35,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:53:35,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:35,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:53:35,459 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:53:35,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2024-11-08 16:53:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:36,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 16:53:36,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:53:38,905 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 26 [2024-11-08 16:53:38,966 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 36 proven. 326 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-08 16:53:38,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:53:40,247 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-08 16:53:40,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-11-08 16:53:40,807 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-11-08 16:53:40,807 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:53:40,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418943182] [2024-11-08 16:53:40,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418943182] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:53:40,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:53:40,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2024-11-08 16:53:40,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522510689] [2024-11-08 16:53:40,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:53:40,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 16:53:40,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:53:40,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 16:53:40,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-11-08 16:53:40,811 INFO L87 Difference]: Start difference. First operand 431 states and 507 transitions. Second operand has 20 states, 16 states have (on average 8.375) internal successors, (134), 18 states have internal predecessors, (134), 7 states have call successors, (36), 4 states have call predecessors, (36), 7 states have return successors, (36), 5 states have call predecessors, (36), 7 states have call successors, (36) [2024-11-08 16:53:45,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:53:45,402 INFO L93 Difference]: Finished difference Result 829 states and 961 transitions. [2024-11-08 16:53:45,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 16:53:45,403 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 8.375) internal successors, (134), 18 states have internal predecessors, (134), 7 states have call successors, (36), 4 states have call predecessors, (36), 7 states have return successors, (36), 5 states have call predecessors, (36), 7 states have call successors, (36) Word has length 160 [2024-11-08 16:53:45,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:53:45,406 INFO L225 Difference]: With dead ends: 829 [2024-11-08 16:53:45,406 INFO L226 Difference]: Without dead ends: 470 [2024-11-08 16:53:45,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 300 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=257, Invalid=613, Unknown=0, NotChecked=0, Total=870 [2024-11-08 16:53:45,407 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 159 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:53:45,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 761 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-08 16:53:45,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-08 16:53:45,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 450. [2024-11-08 16:53:45,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 353 states have (on average 1.1359773371104815) internal successors, (401), 356 states have internal predecessors, (401), 58 states have call successors, (58), 38 states have call predecessors, (58), 38 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-08 16:53:45,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 517 transitions. [2024-11-08 16:53:45,520 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 517 transitions. Word has length 160 [2024-11-08 16:53:45,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:53:45,521 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 517 transitions. [2024-11-08 16:53:45,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 8.375) internal successors, (134), 18 states have internal predecessors, (134), 7 states have call successors, (36), 4 states have call predecessors, (36), 7 states have return successors, (36), 5 states have call predecessors, (36), 7 states have call successors, (36) [2024-11-08 16:53:45,521 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 517 transitions. [2024-11-08 16:53:45,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 16:53:45,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:53:45,522 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:53:45,537 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2024-11-08 16:53:45,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:45,723 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:53:45,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:45,724 INFO L85 PathProgramCache]: Analyzing trace with hash 706690992, now seen corresponding path program 1 times [2024-11-08 16:53:45,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:53:45,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997823586] [2024-11-08 16:53:45,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:53:45,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:45,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:53:45,725 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:53:45,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2024-11-08 16:53:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:46,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 16:53:46,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:53:48,619 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 26 [2024-11-08 16:53:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 36 proven. 326 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-08 16:53:48,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:53:49,706 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-08 16:53:49,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-11-08 16:53:50,284 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-11-08 16:53:50,284 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:53:50,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1997823586] [2024-11-08 16:53:50,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1997823586] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:53:50,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:53:50,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2024-11-08 16:53:50,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069710877] [2024-11-08 16:53:50,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:53:50,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 16:53:50,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:53:50,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 16:53:50,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-11-08 16:53:50,288 INFO L87 Difference]: Start difference. First operand 450 states and 517 transitions. Second operand has 20 states, 16 states have (on average 6.625) internal successors, (106), 18 states have internal predecessors, (106), 7 states have call successors, (36), 4 states have call predecessors, (36), 7 states have return successors, (36), 5 states have call predecessors, (36), 7 states have call successors, (36) [2024-11-08 16:53:54,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:53:54,512 INFO L93 Difference]: Finished difference Result 737 states and 843 transitions. [2024-11-08 16:53:54,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 16:53:54,518 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 6.625) internal successors, (106), 18 states have internal predecessors, (106), 7 states have call successors, (36), 4 states have call predecessors, (36), 7 states have return successors, (36), 5 states have call predecessors, (36), 7 states have call successors, (36) Word has length 160 [2024-11-08 16:53:54,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:53:54,520 INFO L225 Difference]: With dead ends: 737 [2024-11-08 16:53:54,520 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 16:53:54,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 300 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=257, Invalid=613, Unknown=0, NotChecked=0, Total=870 [2024-11-08 16:53:54,522 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 261 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:53:54,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 740 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-08 16:53:54,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 16:53:54,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 16:53:54,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 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-08 16:53:54,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 16:53:54,524 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 160 [2024-11-08 16:53:54,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:53:54,525 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 16:53:54,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 6.625) internal successors, (106), 18 states have internal predecessors, (106), 7 states have call successors, (36), 4 states have call predecessors, (36), 7 states have return successors, (36), 5 states have call predecessors, (36), 7 states have call successors, (36) [2024-11-08 16:53:54,526 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 16:53:54,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 16:53:54,529 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 16:53:54,547 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2024-11-08 16:53:54,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa75a00-a77a-4e24-8575-cae8945c8fee/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:54,734 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:53:54,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 16:54:25,939 WARN L286 SmtUtils]: Spent 18.69s on a formula simplification. DAG size of input: 184 DAG size of output: 160 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-08 16:54:48,396 WARN L286 SmtUtils]: Spent 20.70s on a formula simplification. DAG size of input: 174 DAG size of output: 161 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-08 16:55:03,722 WARN L286 SmtUtils]: Spent 14.72s on a formula simplification. DAG size of input: 169 DAG size of output: 156 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter)