./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB --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 bafc608ae20cc3b925738467682f7a351eaf74a33c9f01487a05b7ea4884eee3 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:28:42,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:28:42,918 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 02:28:42,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:28:42,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:28:42,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:28:42,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:28:42,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:28:42,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:28:42,978 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:28:42,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:28:42,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:28:42,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:28:42,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:28:42,980 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:28:42,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:28:42,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 02:28:42,981 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:28:42,981 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:28:42,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:28:42,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:28:42,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 02:28:42,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:28:42,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 02:28:42,982 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:28:42,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:28:42,983 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:28:42,983 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:28:42,983 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:28:42,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:28:42,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:28:42,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:28:42,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:28:42,985 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:28:42,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:28:42,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:28:42,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:28:42,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:28:42,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:28:42,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:28:42,986 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 02:28:42,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 02:28:42,986 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:28:42,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:28:42,986 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:28:42,986 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:28:42,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:28:42,987 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:28:42,987 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> bafc608ae20cc3b925738467682f7a351eaf74a33c9f01487a05b7ea4884eee3 [2024-11-28 02:28:43,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:28:43,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:28:43,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:28:43,380 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:28:43,380 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:28:43,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i [2024-11-28 02:28:46,617 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/data/591008e66/638f3822f39d4b06a53c693d29f195a2/FLAG831c86bd8 [2024-11-28 02:28:47,017 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:28:47,018 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i [2024-11-28 02:28:47,028 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/data/591008e66/638f3822f39d4b06a53c693d29f195a2/FLAG831c86bd8 [2024-11-28 02:28:47,227 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/data/591008e66/638f3822f39d4b06a53c693d29f195a2 [2024-11-28 02:28:47,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:28:47,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:28:47,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:28:47,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:28:47,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:28:47,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:28:47" (1/1) ... [2024-11-28 02:28:47,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c1380e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:47, skipping insertion in model container [2024-11-28 02:28:47,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:28:47" (1/1) ... [2024-11-28 02:28:47,280 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:28:47,483 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_dd5b8f29-ac08-4706-813f-17f9af44dcc0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i[916,929] [2024-11-28 02:28:47,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:28:47,616 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:28:47,627 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_dd5b8f29-ac08-4706-813f-17f9af44dcc0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i[916,929] [2024-11-28 02:28:47,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:28:47,708 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:28:47,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:47 WrapperNode [2024-11-28 02:28:47,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:28:47,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:28:47,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:28:47,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:28:47,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:47" (1/1) ... [2024-11-28 02:28:47,732 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:47" (1/1) ... [2024-11-28 02:28:47,782 INFO L138 Inliner]: procedures = 29, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 498 [2024-11-28 02:28:47,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:28:47,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:28:47,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:28:47,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:28:47,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:47" (1/1) ... [2024-11-28 02:28:47,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:47" (1/1) ... [2024-11-28 02:28:47,813 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:47" (1/1) ... [2024-11-28 02:28:47,838 INFO L175 MemorySlicer]: Split 141 memory accesses to 5 slices as follows [2, 22, 35, 9, 73]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 3, 5, 2, 9]. The 21 writes are split as follows [0, 3, 5, 2, 11]. [2024-11-28 02:28:47,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:47" (1/1) ... [2024-11-28 02:28:47,839 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:47" (1/1) ... [2024-11-28 02:28:47,863 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:47" (1/1) ... [2024-11-28 02:28:47,865 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:47" (1/1) ... [2024-11-28 02:28:47,870 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:47" (1/1) ... [2024-11-28 02:28:47,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:47" (1/1) ... [2024-11-28 02:28:47,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:47" (1/1) ... [2024-11-28 02:28:47,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:28:47,882 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:28:47,882 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:28:47,882 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:28:47,884 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:47" (1/1) ... [2024-11-28 02:28:47,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:28:47,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:28:47,940 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:28:47,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:28:47,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:28:47,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-28 02:28:47,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-28 02:28:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-28 02:28:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-28 02:28:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-28 02:28:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 02:28:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 02:28:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 02:28:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-28 02:28:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-28 02:28:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-28 02:28:47,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-28 02:28:47,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-28 02:28:47,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-28 02:28:47,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-28 02:28:47,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 02:28:47,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 02:28:47,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 02:28:47,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-28 02:28:47,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-28 02:28:47,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-28 02:28:47,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-28 02:28:47,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-28 02:28:47,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-28 02:28:47,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-28 02:28:47,983 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-28 02:28:47,984 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-28 02:28:47,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:28:47,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 02:28:47,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 02:28:47,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-28 02:28:47,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-28 02:28:47,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:28:47,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:28:48,212 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:28:48,214 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:28:49,024 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-28 02:28:49,025 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:28:49,049 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:28:49,050 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 02:28:49,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:28:49 BoogieIcfgContainer [2024-11-28 02:28:49,050 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:28:49,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:28:49,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:28:49,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:28:49,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:28:47" (1/3) ... [2024-11-28 02:28:49,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e89083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:28:49, skipping insertion in model container [2024-11-28 02:28:49,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:47" (2/3) ... [2024-11-28 02:28:49,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e89083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:28:49, skipping insertion in model container [2024-11-28 02:28:49,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:28:49" (3/3) ... [2024-11-28 02:28:49,065 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-38.i [2024-11-28 02:28:49,083 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:28:49,085 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-38.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 02:28:49,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:28:49,201 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;@667790b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:28:49,203 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 02:28:49,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-28 02:28:49,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-28 02:28:49,229 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:28:49,230 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:28:49,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:28:49,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:28:49,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1484720315, now seen corresponding path program 1 times [2024-11-28 02:28:49,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:28:49,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110166506] [2024-11-28 02:28:49,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:28:49,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:28:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:28:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2024-11-28 02:28:49,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:28:49,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110166506] [2024-11-28 02:28:49,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110166506] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:28:49,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047514866] [2024-11-28 02:28:49,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:28:49,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:28:49,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:28:49,834 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:28:49,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:28:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:28:50,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 02:28:50,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:28:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2024-11-28 02:28:50,389 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:28:50,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047514866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:28:50,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 02:28:50,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-28 02:28:50,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944561190] [2024-11-28 02:28:50,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:28:50,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 02:28:50,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:28:50,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 02:28:50,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:28:50,434 INFO L87 Difference]: Start difference. First operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-28 02:28:50,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:28:50,472 INFO L93 Difference]: Finished difference Result 237 states and 376 transitions. [2024-11-28 02:28:50,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 02:28:50,475 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2024-11-28 02:28:50,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:28:50,483 INFO L225 Difference]: With dead ends: 237 [2024-11-28 02:28:50,483 INFO L226 Difference]: Without dead ends: 118 [2024-11-28 02:28:50,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:28:50,492 INFO L435 NwaCegarLoop]: 172 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, 172 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:28:50,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:28:50,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-28 02:28:50,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-28 02:28:50,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 92 states have internal predecessors, (124), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-28 02:28:50,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-11-28 02:28:50,570 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 184 [2024-11-28 02:28:50,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:28:50,570 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-11-28 02:28:50,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-28 02:28:50,571 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-11-28 02:28:50,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-28 02:28:50,579 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:28:50,579 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:28:50,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 02:28:50,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-28 02:28:50,780 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:28:50,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:28:50,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1050794083, now seen corresponding path program 1 times [2024-11-28 02:28:50,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:28:50,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525272695] [2024-11-28 02:28:50,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:28:50,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:28:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:28:52,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-28 02:28:52,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:28:52,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525272695] [2024-11-28 02:28:52,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525272695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:28:52,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:28:52,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:28:52,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260534925] [2024-11-28 02:28:52,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:28:52,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:28:52,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:28:52,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:28:52,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:28:52,307 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-28 02:28:52,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:28:52,542 INFO L93 Difference]: Finished difference Result 268 states and 391 transitions. [2024-11-28 02:28:52,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:28:52,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2024-11-28 02:28:52,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:28:52,550 INFO L225 Difference]: With dead ends: 268 [2024-11-28 02:28:52,550 INFO L226 Difference]: Without dead ends: 153 [2024-11-28 02:28:52,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:28:52,554 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 48 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:28:52,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 622 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:28:52,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-28 02:28:52,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 121. [2024-11-28 02:28:52,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 95 states have (on average 1.3368421052631578) internal successors, (127), 95 states have internal predecessors, (127), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-28 02:28:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 175 transitions. [2024-11-28 02:28:52,589 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 175 transitions. Word has length 184 [2024-11-28 02:28:52,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:28:52,595 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 175 transitions. [2024-11-28 02:28:52,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-28 02:28:52,595 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 175 transitions. [2024-11-28 02:28:52,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-28 02:28:52,599 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:28:52,600 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:28:52,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:28:52,600 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:28:52,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:28:52,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1250137949, now seen corresponding path program 1 times [2024-11-28 02:28:52,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:28:52,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702547935] [2024-11-28 02:28:52,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:28:52,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:28:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:28:59,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-28 02:28:59,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:28:59,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702547935] [2024-11-28 02:28:59,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702547935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:28:59,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:28:59,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 02:28:59,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284835320] [2024-11-28 02:28:59,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:28:59,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 02:28:59,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:28:59,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 02:28:59,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-28 02:28:59,752 INFO L87 Difference]: Start difference. First operand 121 states and 175 transitions. Second operand has 14 states, 9 states have (on average 7.444444444444445) internal successors, (67), 14 states have internal predecessors, (67), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-28 02:29:03,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:29:03,197 INFO L93 Difference]: Finished difference Result 345 states and 501 transitions. [2024-11-28 02:29:03,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:29:03,198 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 9 states have (on average 7.444444444444445) internal successors, (67), 14 states have internal predecessors, (67), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) Word has length 184 [2024-11-28 02:29:03,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:29:03,202 INFO L225 Difference]: With dead ends: 345 [2024-11-28 02:29:03,205 INFO L226 Difference]: Without dead ends: 227 [2024-11-28 02:29:03,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2024-11-28 02:29:03,208 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 135 mSDsluCounter, 2076 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 2306 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:29:03,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 2306 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-28 02:29:03,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-28 02:29:03,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2024-11-28 02:29:03,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 179 states have (on average 1.3519553072625698) internal successors, (242), 180 states have internal predecessors, (242), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-28 02:29:03,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 326 transitions. [2024-11-28 02:29:03,263 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 326 transitions. Word has length 184 [2024-11-28 02:29:03,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:29:03,264 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 326 transitions. [2024-11-28 02:29:03,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 9 states have (on average 7.444444444444445) internal successors, (67), 14 states have internal predecessors, (67), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-28 02:29:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 326 transitions. [2024-11-28 02:29:03,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-28 02:29:03,271 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:29:03,272 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:29:03,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:29:03,273 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:29:03,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:29:03,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1836943963, now seen corresponding path program 1 times [2024-11-28 02:29:03,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:29:03,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318509145] [2024-11-28 02:29:03,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:29:03,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:29:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:29:05,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-28 02:29:05,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:29:05,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318509145] [2024-11-28 02:29:05,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318509145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:29:05,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:29:05,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:29:05,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711645061] [2024-11-28 02:29:05,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:29:05,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:29:05,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:29:05,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:29:05,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:29:05,236 INFO L87 Difference]: Start difference. First operand 224 states and 326 transitions. Second operand has 7 states, 5 states have (on average 13.4) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-28 02:29:05,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:29:05,841 INFO L93 Difference]: Finished difference Result 549 states and 800 transitions. [2024-11-28 02:29:05,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:29:05,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 13.4) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) Word has length 184 [2024-11-28 02:29:05,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:29:05,850 INFO L225 Difference]: With dead ends: 549 [2024-11-28 02:29:05,851 INFO L226 Difference]: Without dead ends: 328 [2024-11-28 02:29:05,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:29:05,854 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 140 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:29:05,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 687 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 02:29:05,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-28 02:29:05,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 325. [2024-11-28 02:29:05,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 259 states have (on average 1.3474903474903475) internal successors, (349), 261 states have internal predecessors, (349), 62 states have call successors, (62), 3 states have call predecessors, (62), 3 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-28 02:29:05,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 473 transitions. [2024-11-28 02:29:05,960 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 473 transitions. Word has length 184 [2024-11-28 02:29:05,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:29:05,961 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 473 transitions. [2024-11-28 02:29:05,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 13.4) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-28 02:29:05,964 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 473 transitions. [2024-11-28 02:29:05,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-28 02:29:05,967 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:29:05,968 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:29:05,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:29:05,968 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:29:05,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:29:05,969 INFO L85 PathProgramCache]: Analyzing trace with hash -2067786399, now seen corresponding path program 1 times [2024-11-28 02:29:05,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:29:05,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557508060] [2024-11-28 02:29:05,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:29:05,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:29:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:29:08,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-28 02:29:08,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:29:08,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557508060] [2024-11-28 02:29:08,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557508060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:29:08,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:29:08,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 02:29:08,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408483353] [2024-11-28 02:29:08,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:29:08,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 02:29:08,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:29:08,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 02:29:08,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-28 02:29:08,793 INFO L87 Difference]: Start difference. First operand 325 states and 473 transitions. Second operand has 12 states, 7 states have (on average 9.571428571428571) internal successors, (67), 12 states have internal predecessors, (67), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-28 02:29:10,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:29:10,329 INFO L93 Difference]: Finished difference Result 711 states and 1035 transitions. [2024-11-28 02:29:10,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:29:10,330 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 7 states have (on average 9.571428571428571) internal successors, (67), 12 states have internal predecessors, (67), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) Word has length 184 [2024-11-28 02:29:10,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:29:10,338 INFO L225 Difference]: With dead ends: 711 [2024-11-28 02:29:10,341 INFO L226 Difference]: Without dead ends: 389 [2024-11-28 02:29:10,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:29:10,344 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 132 mSDsluCounter, 1982 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 2248 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:29:10,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 2248 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-28 02:29:10,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-28 02:29:10,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 287. [2024-11-28 02:29:10,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 221 states have (on average 1.330316742081448) internal successors, (294), 223 states have internal predecessors, (294), 62 states have call successors, (62), 3 states have call predecessors, (62), 3 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-28 02:29:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 418 transitions. [2024-11-28 02:29:10,420 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 418 transitions. Word has length 184 [2024-11-28 02:29:10,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:29:10,421 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 418 transitions. [2024-11-28 02:29:10,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 7 states have (on average 9.571428571428571) internal successors, (67), 12 states have internal predecessors, (67), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-28 02:29:10,422 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 418 transitions. [2024-11-28 02:29:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-28 02:29:10,425 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:29:10,425 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:29:10,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 02:29:10,426 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:29:10,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:29:10,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1031283231, now seen corresponding path program 1 times [2024-11-28 02:29:10,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:29:10,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642763055] [2024-11-28 02:29:10,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:29:10,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:29:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:29:12,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-28 02:29:12,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:29:12,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642763055] [2024-11-28 02:29:12,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642763055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:29:12,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:29:12,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 02:29:12,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912112380] [2024-11-28 02:29:12,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:29:12,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 02:29:12,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:29:12,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 02:29:12,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:29:12,283 INFO L87 Difference]: Start difference. First operand 287 states and 418 transitions. Second operand has 9 states, 6 states have (on average 11.166666666666666) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-28 02:29:13,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:29:13,348 INFO L93 Difference]: Finished difference Result 521 states and 751 transitions. [2024-11-28 02:29:13,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:29:13,349 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 11.166666666666666) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) Word has length 184 [2024-11-28 02:29:13,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:29:13,352 INFO L225 Difference]: With dead ends: 521 [2024-11-28 02:29:13,352 INFO L226 Difference]: Without dead ends: 294 [2024-11-28 02:29:13,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-28 02:29:13,354 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 138 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:29:13,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1576 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 02:29:13,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-28 02:29:13,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 226. [2024-11-28 02:29:13,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 180 states have (on average 1.3333333333333333) internal successors, (240), 181 states have internal predecessors, (240), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-28 02:29:13,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 324 transitions. [2024-11-28 02:29:13,414 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 324 transitions. Word has length 184 [2024-11-28 02:29:13,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:29:13,416 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 324 transitions. [2024-11-28 02:29:13,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 11.166666666666666) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-28 02:29:13,417 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 324 transitions. [2024-11-28 02:29:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-28 02:29:13,419 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:29:13,420 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:29:13,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 02:29:13,420 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:29:13,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:29:13,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1618089245, now seen corresponding path program 1 times [2024-11-28 02:29:13,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:29:13,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430583468] [2024-11-28 02:29:13,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:29:13,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:29:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:29:15,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-28 02:29:15,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:29:15,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430583468] [2024-11-28 02:29:15,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430583468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:29:15,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:29:15,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 02:29:15,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397788111] [2024-11-28 02:29:15,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:29:15,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 02:29:15,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:29:15,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 02:29:15,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-28 02:29:15,539 INFO L87 Difference]: Start difference. First operand 226 states and 324 transitions. Second operand has 11 states, 8 states have (on average 8.375) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-28 02:29:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:29:16,662 INFO L93 Difference]: Finished difference Result 513 states and 737 transitions. [2024-11-28 02:29:16,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 02:29:16,663 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 8.375) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) Word has length 184 [2024-11-28 02:29:16,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:29:16,669 INFO L225 Difference]: With dead ends: 513 [2024-11-28 02:29:16,670 INFO L226 Difference]: Without dead ends: 290 [2024-11-28 02:29:16,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-28 02:29:16,672 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 132 mSDsluCounter, 1896 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:29:16,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 2182 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 02:29:16,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-28 02:29:16,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 201. [2024-11-28 02:29:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 155 states have (on average 1.3096774193548386) internal successors, (203), 156 states have internal predecessors, (203), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-28 02:29:16,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 287 transitions. [2024-11-28 02:29:16,735 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 287 transitions. Word has length 184 [2024-11-28 02:29:16,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:29:16,736 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 287 transitions. [2024-11-28 02:29:16,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 8.375) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-28 02:29:16,737 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 287 transitions. [2024-11-28 02:29:16,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-28 02:29:16,740 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:29:16,740 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:29:16,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 02:29:16,740 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:29:16,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:29:16,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1729973726, now seen corresponding path program 1 times [2024-11-28 02:29:16,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:29:16,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628854117] [2024-11-28 02:29:16,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:29:16,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:29:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:29:22,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-28 02:29:22,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:29:22,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628854117] [2024-11-28 02:29:22,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628854117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:29:22,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:29:22,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 02:29:22,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309108728] [2024-11-28 02:29:22,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:29:22,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 02:29:22,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:29:22,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 02:29:22,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:29:22,590 INFO L87 Difference]: Start difference. First operand 201 states and 287 transitions. Second operand has 15 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 15 states have internal predecessors, (69), 5 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 5 states have call successors, (24) [2024-11-28 02:29:25,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:29:25,704 INFO L93 Difference]: Finished difference Result 539 states and 760 transitions. [2024-11-28 02:29:25,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 02:29:25,705 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 15 states have internal predecessors, (69), 5 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 5 states have call successors, (24) Word has length 186 [2024-11-28 02:29:25,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:29:25,715 INFO L225 Difference]: With dead ends: 539 [2024-11-28 02:29:25,715 INFO L226 Difference]: Without dead ends: 398 [2024-11-28 02:29:25,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2024-11-28 02:29:25,716 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 252 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:29:25,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 2010 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-28 02:29:25,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-28 02:29:25,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 392. [2024-11-28 02:29:25,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 310 states have (on average 1.3161290322580645) internal successors, (408), 313 states have internal predecessors, (408), 74 states have call successors, (74), 7 states have call predecessors, (74), 7 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-28 02:29:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 556 transitions. [2024-11-28 02:29:25,847 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 556 transitions. Word has length 186 [2024-11-28 02:29:25,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:29:25,848 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 556 transitions. [2024-11-28 02:29:25,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 15 states have internal predecessors, (69), 5 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 5 states have call successors, (24) [2024-11-28 02:29:25,848 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 556 transitions. [2024-11-28 02:29:25,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-28 02:29:25,850 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:29:25,851 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:29:25,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 02:29:25,851 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:29:25,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:29:25,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1049915356, now seen corresponding path program 1 times [2024-11-28 02:29:25,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:29:25,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776981616] [2024-11-28 02:29:25,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:29:25,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:29:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:29:27,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-11-28 02:29:27,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:29:27,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776981616] [2024-11-28 02:29:27,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776981616] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:29:27,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508144326] [2024-11-28 02:29:27,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:29:27,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:27,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:29:27,655 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:29:27,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:29:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:29:28,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-28 02:29:28,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:29:28,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:29:28,181 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 19 treesize of output 7 [2024-11-28 02:29:28,239 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 31 treesize of output 15 [2024-11-28 02:29:28,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-28 02:29:28,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 44 [2024-11-28 02:29:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 383 proven. 12 refuted. 0 times theorem prover too weak. 709 trivial. 0 not checked. [2024-11-28 02:29:28,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:29:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 120 proven. 15 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-28 02:29:29,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508144326] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:29:29,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:29:29,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 27 [2024-11-28 02:29:29,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168810911] [2024-11-28 02:29:29,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:29:29,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-28 02:29:29,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:29:29,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-28 02:29:29,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2024-11-28 02:29:29,439 INFO L87 Difference]: Start difference. First operand 392 states and 556 transitions. Second operand has 27 states, 20 states have (on average 5.2) internal successors, (104), 27 states have internal predecessors, (104), 12 states have call successors, (33), 3 states have call predecessors, (33), 7 states have return successors, (33), 5 states have call predecessors, (33), 12 states have call successors, (33) [2024-11-28 02:29:32,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:29:32,157 INFO L93 Difference]: Finished difference Result 669 states and 926 transitions. [2024-11-28 02:29:32,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-28 02:29:32,158 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 20 states have (on average 5.2) internal successors, (104), 27 states have internal predecessors, (104), 12 states have call successors, (33), 3 states have call predecessors, (33), 7 states have return successors, (33), 5 states have call predecessors, (33), 12 states have call successors, (33) Word has length 186 [2024-11-28 02:29:32,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:29:32,162 INFO L225 Difference]: With dead ends: 669 [2024-11-28 02:29:32,162 INFO L226 Difference]: Without dead ends: 337 [2024-11-28 02:29:32,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 365 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=439, Invalid=1817, Unknown=0, NotChecked=0, Total=2256 [2024-11-28 02:29:32,166 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 709 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:29:32,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1257 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-28 02:29:32,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-28 02:29:32,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 264. [2024-11-28 02:29:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 208 states have (on average 1.2740384615384615) internal successors, (265), 209 states have internal predecessors, (265), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-28 02:29:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 357 transitions. [2024-11-28 02:29:32,296 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 357 transitions. Word has length 186 [2024-11-28 02:29:32,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:29:32,297 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 357 transitions. [2024-11-28 02:29:32,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 20 states have (on average 5.2) internal successors, (104), 27 states have internal predecessors, (104), 12 states have call successors, (33), 3 states have call predecessors, (33), 7 states have return successors, (33), 5 states have call predecessors, (33), 12 states have call successors, (33) [2024-11-28 02:29:32,299 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 357 transitions. [2024-11-28 02:29:32,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-28 02:29:32,304 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:29:32,304 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:29:32,318 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 02:29:32,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:32,505 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:29:32,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:29:32,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1948828444, now seen corresponding path program 1 times [2024-11-28 02:29:32,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:29:32,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738871128] [2024-11-28 02:29:32,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:29:32,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:29:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:29:34,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-28 02:29:34,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:29:34,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738871128] [2024-11-28 02:29:34,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738871128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:29:34,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:29:34,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 02:29:34,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4526318] [2024-11-28 02:29:34,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:29:34,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 02:29:34,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:29:34,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 02:29:34,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-28 02:29:34,809 INFO L87 Difference]: Start difference. First operand 264 states and 357 transitions. Second operand has 13 states, 10 states have (on average 6.9) internal successors, (69), 13 states have internal predecessors, (69), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-28 02:29:36,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:29:36,451 INFO L93 Difference]: Finished difference Result 583 states and 797 transitions. [2024-11-28 02:29:36,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:29:36,452 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 6.9) internal successors, (69), 13 states have internal predecessors, (69), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) Word has length 186 [2024-11-28 02:29:36,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:29:36,455 INFO L225 Difference]: With dead ends: 583 [2024-11-28 02:29:36,456 INFO L226 Difference]: Without dead ends: 322 [2024-11-28 02:29:36,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-11-28 02:29:36,457 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 256 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:29:36,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1202 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-28 02:29:36,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-28 02:29:36,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 261. [2024-11-28 02:29:36,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 205 states have (on average 1.2682926829268293) internal successors, (260), 206 states have internal predecessors, (260), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-28 02:29:36,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 352 transitions. [2024-11-28 02:29:36,544 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 352 transitions. Word has length 186 [2024-11-28 02:29:36,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:29:36,545 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 352 transitions. [2024-11-28 02:29:36,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 6.9) internal successors, (69), 13 states have internal predecessors, (69), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-28 02:29:36,545 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 352 transitions. [2024-11-28 02:29:36,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-28 02:29:36,553 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:29:36,553 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:29:36,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 02:29:36,554 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:29:36,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:29:36,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1526935512, now seen corresponding path program 1 times [2024-11-28 02:29:36,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:29:36,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418095951] [2024-11-28 02:29:36,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:29:36,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:29:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:29:36,707 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 02:29:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:29:36,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 02:29:36,962 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 02:29:36,963 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-28 02:29:36,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 02:29:36,969 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:29:37,135 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 02:29:37,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:29:37 BoogieIcfgContainer [2024-11-28 02:29:37,139 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 02:29:37,140 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 02:29:37,140 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 02:29:37,140 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 02:29:37,141 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:28:49" (3/4) ... [2024-11-28 02:29:37,144 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-28 02:29:37,145 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 02:29:37,146 INFO L158 Benchmark]: Toolchain (without parser) took 49913.95ms. Allocated memory was 117.4MB in the beginning and 780.1MB in the end (delta: 662.7MB). Free memory was 85.2MB in the beginning and 443.1MB in the end (delta: -357.9MB). Peak memory consumption was 303.8MB. Max. memory is 16.1GB. [2024-11-28 02:29:37,146 INFO L158 Benchmark]: CDTParser took 1.20ms. Allocated memory is still 167.8MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:29:37,146 INFO L158 Benchmark]: CACSL2BoogieTranslator took 474.92ms. Allocated memory is still 117.4MB. Free memory was 85.2MB in the beginning and 69.0MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 02:29:37,147 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.50ms. Allocated memory is still 117.4MB. Free memory was 69.0MB in the beginning and 64.5MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:29:37,147 INFO L158 Benchmark]: Boogie Preprocessor took 97.68ms. Allocated memory is still 117.4MB. Free memory was 64.5MB in the beginning and 59.0MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 02:29:37,147 INFO L158 Benchmark]: RCFGBuilder took 1168.59ms. Allocated memory is still 117.4MB. Free memory was 59.0MB in the beginning and 76.4MB in the end (delta: -17.4MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2024-11-28 02:29:37,148 INFO L158 Benchmark]: TraceAbstraction took 48086.29ms. Allocated memory was 117.4MB in the beginning and 780.1MB in the end (delta: 662.7MB). Free memory was 75.8MB in the beginning and 443.2MB in the end (delta: -367.4MB). Peak memory consumption was 296.9MB. Max. memory is 16.1GB. [2024-11-28 02:29:37,148 INFO L158 Benchmark]: Witness Printer took 5.01ms. Allocated memory is still 780.1MB. Free memory was 443.2MB in the beginning and 443.1MB in the end (delta: 161.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:29:37,150 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.20ms. Allocated memory is still 167.8MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 474.92ms. Allocated memory is still 117.4MB. Free memory was 85.2MB in the beginning and 69.0MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.50ms. Allocated memory is still 117.4MB. Free memory was 69.0MB in the beginning and 64.5MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 97.68ms. Allocated memory is still 117.4MB. Free memory was 64.5MB in the beginning and 59.0MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1168.59ms. Allocated memory is still 117.4MB. Free memory was 59.0MB in the beginning and 76.4MB in the end (delta: -17.4MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. * TraceAbstraction took 48086.29ms. Allocated memory was 117.4MB in the beginning and 780.1MB in the end (delta: 662.7MB). Free memory was 75.8MB in the beginning and 443.2MB in the end (delta: -367.4MB). Peak memory consumption was 296.9MB. Max. memory is 16.1GB. * Witness Printer took 5.01ms. Allocated memory is still 780.1MB. Free memory was 443.2MB in the beginning and 443.1MB in the end (delta: 161.9kB). 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 someBinaryArithmeticDOUBLEoperation at line 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 70. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2] = { 1771558822, 16 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2] = { 1771558822, 16 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2] = { 1771558822, 16 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L104] isInitial = 1 [L105] FCALL initially() [L107] FCALL updateLastVariables() [L108] CALL updateVariables() [L58] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L59] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L59] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L59] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L60] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L60] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L60] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L61] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L62] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L62] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L62] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L63] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L64] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] double_Array_0[0] = __VERIFIER_nondet_double() [L68] EXPR double_Array_0[0] [L68] EXPR double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F [L68] EXPR double_Array_0[0] [L68] EXPR double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR (double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR (double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] CALL assume_abort_if_not((double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] RET assume_abort_if_not((double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] double_Array_0[1] = __VERIFIER_nondet_double() [L70] EXPR double_Array_0[1] [L70] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F [L70] EXPR double_Array_0[1] [L70] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] CALL assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] RET assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] double_Array_0[2] = __VERIFIER_nondet_double() [L72] EXPR double_Array_0[2] [L72] EXPR double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F [L72] EXPR double_Array_0[2] [L72] EXPR double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR (double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 1152921.504606845700e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR (double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 1152921.504606845700e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] CALL assume_abort_if_not((double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 1152921.504606845700e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] RET assume_abort_if_not((double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 1152921.504606845700e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] double_Array_0[4] = __VERIFIER_nondet_double() [L74] EXPR double_Array_0[4] [L74] EXPR double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F [L74] EXPR double_Array_0[4] [L74] EXPR double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR (double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 1152921.504606845700e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR (double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 1152921.504606845700e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] CALL assume_abort_if_not((double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 1152921.504606845700e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] RET assume_abort_if_not((double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 1152921.504606845700e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L75] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L76] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1610612735) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1610612735) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] unsigned_short_int_Array_0[1][0] = __VERIFIER_nondet_ushort() [L79] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 16384) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 16384) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L82] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] unsigned_short_int_Array_0[1][1] = __VERIFIER_nondet_ushort() [L85] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L87] unsigned_short_int_Array_0[2][1] = __VERIFIER_nondet_ushort() [L88] EXPR unsigned_short_int_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L88] CALL assume_abort_if_not(unsigned_short_int_Array_0[2][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L88] RET assume_abort_if_not(unsigned_short_int_Array_0[2][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L89] EXPR unsigned_short_int_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L89] CALL assume_abort_if_not(unsigned_short_int_Array_0[2][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L89] RET assume_abort_if_not(unsigned_short_int_Array_0[2][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L90] unsigned_short_int_Array_0[0][2] = __VERIFIER_nondet_ushort() [L91] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L93] unsigned_short_int_Array_0[1][2] = __VERIFIER_nondet_ushort() [L94] EXPR unsigned_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L94] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][2] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L94] RET assume_abort_if_not(unsigned_short_int_Array_0[1][2] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L95] EXPR unsigned_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L95] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L95] RET assume_abort_if_not(unsigned_short_int_Array_0[1][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L108] RET updateVariables() [L109] CALL step() [L37] EXPR unsigned_short_int_Array_0[1][2] [L37] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L37] EXPR ((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]) [L37] EXPR unsigned_short_int_Array_0[1][2] [L37] EXPR ((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L37] EXPR unsigned_short_int_Array_0[2][1] [L37] unsigned_short_int_Array_0[2][2] = (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]) [L38] EXPR unsigned_short_int_Array_0[1][2] [L38] unsigned short int stepLocal_0 = unsigned_short_int_Array_0[1][2]; [L39] EXPR unsigned_short_int_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L39] COND FALSE !(unsigned_short_int_Array_0[2][1] > stepLocal_0) [L42] EXPR double_Array_0[1] [L42] EXPR double_Array_0[0] [L42] EXPR double_Array_0[2] [L42] EXPR double_Array_0[4] [L42] double_Array_0[3] = (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4]))) [L43] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L43] COND TRUE ! BOOL_unsigned_char_Array_0[0] [L44] EXPR unsigned_short_int_Array_0[0][2] [L44] EXPR unsigned_short_int_Array_0[0][1] [L44] EXPR unsigned_short_int_Array_0[1][1] [L44] unsigned_short_int_Array_0[0][0] = (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])) [L52] EXPR BOOL_unsigned_char_Array_0[2] [L52] unsigned char stepLocal_1 = BOOL_unsigned_char_Array_0[2]; [L53] EXPR BOOL_unsigned_char_Array_0[0] [L53] EXPR BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, stepLocal_1=256, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L53] EXPR BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L53] COND FALSE !((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) && stepLocal_1) [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR unsigned_short_int_Array_0[2][2] [L100] EXPR unsigned_short_int_Array_0[1][2] [L100] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR ((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]) [L100] EXPR unsigned_short_int_Array_0[1][2] [L100] EXPR ((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR unsigned_short_int_Array_0[2][1] [L100] EXPR (unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR (unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1) [L100] EXPR unsigned_short_int_Array_0[2][1] [L100] EXPR unsigned_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR (unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1 [L100] EXPR (unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR (unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR ((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR ((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4]))))) [L100] EXPR double_Array_0[3] [L100] EXPR double_Array_0[1] [L100] EXPR double_Array_0[0] [L100] EXPR double_Array_0[2] [L100] EXPR double_Array_0[4] [L100] EXPR ((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR (((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((27636 + unsigned_short_int_Array_0[1][0]) - (((((16853 - 10)) > (unsigned_short_int_Array_0[0][1])) ? ((16853 - 10)) : (unsigned_short_int_Array_0[0][1])))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR (((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((27636 + unsigned_short_int_Array_0[1][0]) - (((((16853 - 10)) > (unsigned_short_int_Array_0[0][1])) ? ((16853 - 10)) : (unsigned_short_int_Array_0[0][1])))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR ((((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((27636 + unsigned_short_int_Array_0[1][0]) - (((((16853 - 10)) > (unsigned_short_int_Array_0[0][1])) ? ((16853 - 10)) : (unsigned_short_int_Array_0[0][1])))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))))) && (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[2]) ? (unsigned_short_int_Array_0[2][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] + unsigned_short_int_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR ((((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((27636 + unsigned_short_int_Array_0[1][0]) - (((((16853 - 10)) > (unsigned_short_int_Array_0[0][1])) ? ((16853 - 10)) : (unsigned_short_int_Array_0[0][1])))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))))) && (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[2]) ? (unsigned_short_int_Array_0[2][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] + unsigned_short_int_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100-L101] return ((((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((27636 + unsigned_short_int_Array_0[1][0]) - (((((16853 - 10)) > (unsigned_short_int_Array_0[0][1])) ? ((16853 - 10)) : (unsigned_short_int_Array_0[0][1])))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))))) && (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[2]) ? (unsigned_short_int_Array_0[2][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] + unsigned_short_int_Array_0[0][1]))) : 1) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.8s, OverallIterations: 11, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1969 SdHoareTripleChecker+Valid, 12.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1942 mSDsluCounter, 14262 SdHoareTripleChecker+Invalid, 10.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12320 mSDsCounter, 441 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6918 IncrementalHoareTripleChecker+Invalid, 7359 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 441 mSolverCounterUnsat, 1942 mSDtfsCounter, 6918 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 765 GetRequests, 616 SyntacticMatches, 6 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=8, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 437 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 27.0s InterpolantComputationTime, 2402 NumberOfCodeBlocks, 2402 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2389 ConstructedInterpolants, 0 QuantifiedInterpolants, 8770 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1208 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 14261/14352 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-28 02:29:37,179 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB --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 bafc608ae20cc3b925738467682f7a351eaf74a33c9f01487a05b7ea4884eee3 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:29:40,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:29:40,319 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-28 02:29:40,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:29:40,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:29:40,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:29:40,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:29:40,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:29:40,411 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:29:40,411 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:29:40,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:29:40,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:29:40,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:29:40,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:29:40,412 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:29:40,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:29:40,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 02:29:40,412 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:29:40,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:29:40,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:29:40,412 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 02:29:40,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:29:40,413 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 02:29:40,413 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 02:29:40,413 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 02:29:40,413 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 02:29:40,413 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:29:40,413 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:29:40,413 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:29:40,413 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:29:40,414 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:29:40,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:29:40,414 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:29:40,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:29:40,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:29:40,419 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:29:40,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:29:40,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:29:40,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:29:40,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:29:40,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:29:40,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:29:40,420 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 02:29:40,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 02:29:40,420 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 02:29:40,421 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 02:29:40,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:29:40,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:29:40,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:29:40,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:29:40,421 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> bafc608ae20cc3b925738467682f7a351eaf74a33c9f01487a05b7ea4884eee3 [2024-11-28 02:29:40,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:29:40,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:29:40,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:29:40,843 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:29:40,844 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:29:40,845 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i [2024-11-28 02:29:44,131 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/data/5e3fdbb6d/e61ad6a1be5b4672979e5e6638d0392b/FLAG28d633107 [2024-11-28 02:29:44,567 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:29:44,568 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i [2024-11-28 02:29:44,585 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/data/5e3fdbb6d/e61ad6a1be5b4672979e5e6638d0392b/FLAG28d633107 [2024-11-28 02:29:44,612 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/data/5e3fdbb6d/e61ad6a1be5b4672979e5e6638d0392b [2024-11-28 02:29:44,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:29:44,617 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:29:44,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:29:44,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:29:44,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:29:44,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:29:44" (1/1) ... [2024-11-28 02:29:44,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8fc7f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:44, skipping insertion in model container [2024-11-28 02:29:44,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:29:44" (1/1) ... [2024-11-28 02:29:44,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:29:44,880 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_dd5b8f29-ac08-4706-813f-17f9af44dcc0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i[916,929] [2024-11-28 02:29:45,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:29:45,060 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:29:45,076 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_dd5b8f29-ac08-4706-813f-17f9af44dcc0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i[916,929] [2024-11-28 02:29:45,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:29:45,199 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:29:45,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:45 WrapperNode [2024-11-28 02:29:45,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:29:45,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:29:45,201 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:29:45,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:29:45,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:45" (1/1) ... [2024-11-28 02:29:45,227 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:45" (1/1) ... [2024-11-28 02:29:45,277 INFO L138 Inliner]: procedures = 36, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 498 [2024-11-28 02:29:45,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:29:45,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:29:45,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:29:45,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:29:45,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:45" (1/1) ... [2024-11-28 02:29:45,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:45" (1/1) ... [2024-11-28 02:29:45,312 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:45" (1/1) ... [2024-11-28 02:29:45,364 INFO L175 MemorySlicer]: Split 141 memory accesses to 5 slices as follows [2, 22, 35, 9, 73]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 3, 5, 2, 9]. The 21 writes are split as follows [0, 3, 5, 2, 11]. [2024-11-28 02:29:45,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:45" (1/1) ... [2024-11-28 02:29:45,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:45" (1/1) ... [2024-11-28 02:29:45,419 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:45" (1/1) ... [2024-11-28 02:29:45,423 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:45" (1/1) ... [2024-11-28 02:29:45,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:45" (1/1) ... [2024-11-28 02:29:45,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:45" (1/1) ... [2024-11-28 02:29:45,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:45" (1/1) ... [2024-11-28 02:29:45,463 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:29:45,464 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:29:45,464 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:29:45,465 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:29:45,466 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:45" (1/1) ... [2024-11-28 02:29:45,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:29:45,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:29:45,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:29:45,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:29:45,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:29:45,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-28 02:29:45,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-28 02:29:45,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-28 02:29:45,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-28 02:29:45,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-28 02:29:45,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-28 02:29:45,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-28 02:29:45,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-28 02:29:45,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-28 02:29:45,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-28 02:29:45,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-28 02:29:45,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-28 02:29:45,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-28 02:29:45,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-28 02:29:45,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-28 02:29:45,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-28 02:29:45,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-28 02:29:45,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-28 02:29:45,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-28 02:29:45,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-28 02:29:45,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 02:29:45,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 02:29:45,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-28 02:29:45,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-28 02:29:45,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-28 02:29:45,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-28 02:29:45,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-28 02:29:45,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-28 02:29:45,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-28 02:29:45,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-28 02:29:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-28 02:29:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-28 02:29:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-28 02:29:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-28 02:29:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-28 02:29:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-28 02:29:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-28 02:29:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-28 02:29:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-28 02:29:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-28 02:29:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-28 02:29:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-28 02:29:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-28 02:29:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-28 02:29:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-28 02:29:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-28 02:29:45,555 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-28 02:29:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:29:45,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:29:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-28 02:29:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-28 02:29:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-28 02:29:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-28 02:29:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-28 02:29:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-28 02:29:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-28 02:29:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-28 02:29:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-28 02:29:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-28 02:29:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-28 02:29:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-28 02:29:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-28 02:29:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-28 02:29:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-28 02:29:45,776 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:29:45,778 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:29:54,833 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-28 02:29:54,833 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:29:54,854 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:29:54,854 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 02:29:54,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:29:54 BoogieIcfgContainer [2024-11-28 02:29:54,857 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:29:54,859 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:29:54,860 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:29:54,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:29:54,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:29:44" (1/3) ... [2024-11-28 02:29:54,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f331eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:29:54, skipping insertion in model container [2024-11-28 02:29:54,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:45" (2/3) ... [2024-11-28 02:29:54,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f331eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:29:54, skipping insertion in model container [2024-11-28 02:29:54,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:29:54" (3/3) ... [2024-11-28 02:29:54,872 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-38.i [2024-11-28 02:29:54,892 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:29:54,894 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-38.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 02:29:54,986 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:29:55,009 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;@6342fdd1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:29:55,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 02:29:55,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-28 02:29:55,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-28 02:29:55,039 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:29:55,040 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:29:55,044 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:29:55,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:29:55,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1484720315, now seen corresponding path program 1 times [2024-11-28 02:29:55,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:29:55,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724000120] [2024-11-28 02:29:55,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:29:55,071 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-28 02:29:55,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:29:55,073 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:29:55,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:29:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:29:55,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 02:29:56,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:29:56,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-28 02:29:56,103 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:29:56,104 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:29:56,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724000120] [2024-11-28 02:29:56,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724000120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:29:56,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:29:56,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:29:56,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234364092] [2024-11-28 02:29:56,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:29:56,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 02:29:56,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:29:56,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 02:29:56,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:29:56,149 INFO L87 Difference]: Start difference. First operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-28 02:29:56,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:29:56,204 INFO L93 Difference]: Finished difference Result 237 states and 376 transitions. [2024-11-28 02:29:56,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 02:29:56,207 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2024-11-28 02:29:56,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:29:56,215 INFO L225 Difference]: With dead ends: 237 [2024-11-28 02:29:56,216 INFO L226 Difference]: Without dead ends: 118 [2024-11-28 02:29:56,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:29:56,223 INFO L435 NwaCegarLoop]: 172 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, 172 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:29:56,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:29:56,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-28 02:29:56,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-28 02:29:56,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 92 states have internal predecessors, (124), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-28 02:29:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-11-28 02:29:56,290 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 184 [2024-11-28 02:29:56,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:29:56,291 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-11-28 02:29:56,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-28 02:29:56,292 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-11-28 02:29:56,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-28 02:29:56,298 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:29:56,298 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:29:56,317 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:29:56,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:29:56,499 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:29:56,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:29:56,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1050794083, now seen corresponding path program 1 times [2024-11-28 02:29:56,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:29:56,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921649409] [2024-11-28 02:29:56,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:29:56,502 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-28 02:29:56,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:29:56,504 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:29:56,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:29:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:29:57,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 02:29:57,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:29:57,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-28 02:29:57,479 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:29:57,480 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:29:57,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921649409] [2024-11-28 02:29:57,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921649409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:29:57,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:29:57,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:29:57,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15959646] [2024-11-28 02:29:57,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:29:57,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:29:57,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:29:57,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:29:57,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:29:57,490 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-28 02:30:00,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:30:00,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:30:00,542 INFO L93 Difference]: Finished difference Result 268 states and 391 transitions. [2024-11-28 02:30:00,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:30:00,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2024-11-28 02:30:00,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:30:00,547 INFO L225 Difference]: With dead ends: 268 [2024-11-28 02:30:00,547 INFO L226 Difference]: Without dead ends: 153 [2024-11-28 02:30:00,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:30:00,549 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 48 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:30:00,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 622 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-28 02:30:00,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-28 02:30:00,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 121. [2024-11-28 02:30:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 95 states have (on average 1.3368421052631578) internal successors, (127), 95 states have internal predecessors, (127), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-28 02:30:00,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 175 transitions. [2024-11-28 02:30:00,575 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 175 transitions. Word has length 184 [2024-11-28 02:30:00,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:30:00,577 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 175 transitions. [2024-11-28 02:30:00,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-28 02:30:00,578 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 175 transitions. [2024-11-28 02:30:00,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-28 02:30:00,585 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:30:00,586 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:30:00,606 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:30:00,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:30:00,790 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:30:00,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:30:00,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1250137949, now seen corresponding path program 1 times [2024-11-28 02:30:00,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:30:00,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548457201] [2024-11-28 02:30:00,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:30:00,792 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-28 02:30:00,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:30:00,795 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:30:00,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:30:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:30:01,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-28 02:30:01,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:30:01,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:30:02,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-28 02:30:02,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2024-11-28 02:30:03,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:30:03,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 26 [2024-11-28 02:30:04,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 385 proven. 15 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2024-11-28 02:30:04,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:30:05,657 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:30:05,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548457201] [2024-11-28 02:30:05,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548457201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:30:05,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [382707416] [2024-11-28 02:30:05,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:30:05,658 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 02:30:05,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 02:30:05,662 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 02:30:05,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-28 02:30:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:30:08,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 02:30:08,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:30:09,094 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-28 02:30:10,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-28 02:30:10,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-28 02:30:12,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:30:12,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2024-11-28 02:30:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 475 proven. 12 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2024-11-28 02:30:12,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:30:14,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 120 proven. 15 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-28 02:30:14,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [382707416] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:30:14,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:30:14,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 11] total 37 [2024-11-28 02:30:14,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536794712] [2024-11-28 02:30:14,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:30:14,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-28 02:30:14,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:30:14,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-28 02:30:14,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1477, Unknown=0, NotChecked=0, Total=1806 [2024-11-28 02:30:14,222 INFO L87 Difference]: Start difference. First operand 121 states and 175 transitions. Second operand has 37 states, 30 states have (on average 5.366666666666666) internal successors, (161), 36 states have internal predecessors, (161), 16 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (53), 9 states have call predecessors, (53), 16 states have call successors, (53) [2024-11-28 02:30:23,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:30:23,573 INFO L93 Difference]: Finished difference Result 365 states and 516 transitions. [2024-11-28 02:30:23,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-28 02:30:23,574 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 30 states have (on average 5.366666666666666) internal successors, (161), 36 states have internal predecessors, (161), 16 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (53), 9 states have call predecessors, (53), 16 states have call successors, (53) Word has length 184 [2024-11-28 02:30:23,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:30:23,579 INFO L225 Difference]: With dead ends: 365 [2024-11-28 02:30:23,579 INFO L226 Difference]: Without dead ends: 247 [2024-11-28 02:30:23,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 546 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=974, Invalid=3582, Unknown=0, NotChecked=0, Total=4556 [2024-11-28 02:30:23,587 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 917 mSDsluCounter, 1386 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:30:23,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1497 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-28 02:30:23,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-28 02:30:23,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 238. [2024-11-28 02:30:23,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 189 states have (on average 1.3227513227513228) internal successors, (250), 190 states have internal predecessors, (250), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-28 02:30:23,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 334 transitions. [2024-11-28 02:30:23,653 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 334 transitions. Word has length 184 [2024-11-28 02:30:23,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:30:23,654 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 334 transitions. [2024-11-28 02:30:23,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 30 states have (on average 5.366666666666666) internal successors, (161), 36 states have internal predecessors, (161), 16 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (53), 9 states have call predecessors, (53), 16 states have call successors, (53) [2024-11-28 02:30:23,657 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 334 transitions. [2024-11-28 02:30:23,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-28 02:30:23,663 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:30:23,664 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:30:23,680 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-28 02:30:23,877 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:30:24,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:30:24,065 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:30:24,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:30:24,066 INFO L85 PathProgramCache]: Analyzing trace with hash -2067786399, now seen corresponding path program 1 times [2024-11-28 02:30:24,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:30:24,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63592568] [2024-11-28 02:30:24,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:30:24,067 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-28 02:30:24,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:30:24,072 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:30:24,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-28 02:30:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:30:25,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 02:30:25,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:30:25,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:30:25,240 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 14 treesize of output 10 [2024-11-28 02:30:25,383 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 30 treesize of output 14 [2024-11-28 02:30:25,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:30:25,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2024-11-28 02:30:25,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:30:25,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 84 treesize of output 92 [2024-11-28 02:30:26,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:30:26,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 146 treesize of output 70 [2024-11-28 02:30:26,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2024-11-28 02:30:26,299 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:30:26,299 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:30:26,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63592568] [2024-11-28 02:30:26,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [63592568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:30:26,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:30:26,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 02:30:26,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387903993] [2024-11-28 02:30:26,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:30:26,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 02:30:26,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:30:26,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 02:30:26,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:30:26,302 INFO L87 Difference]: Start difference. First operand 238 states and 334 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-28 02:30:30,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:30:30,465 INFO L93 Difference]: Finished difference Result 623 states and 881 transitions. [2024-11-28 02:30:30,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:30:30,466 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2024-11-28 02:30:30,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:30:30,472 INFO L225 Difference]: With dead ends: 623 [2024-11-28 02:30:30,472 INFO L226 Difference]: Without dead ends: 388 [2024-11-28 02:30:30,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-28 02:30:30,474 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 403 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:30:30,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 993 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-28 02:30:30,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-28 02:30:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 321. [2024-11-28 02:30:30,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 257 states have (on average 1.3346303501945525) internal successors, (343), 259 states have internal predecessors, (343), 56 states have call successors, (56), 7 states have call predecessors, (56), 7 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-28 02:30:30,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 455 transitions. [2024-11-28 02:30:30,548 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 455 transitions. Word has length 184 [2024-11-28 02:30:30,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:30:30,549 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 455 transitions. [2024-11-28 02:30:30,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-28 02:30:30,550 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 455 transitions. [2024-11-28 02:30:30,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-28 02:30:30,553 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:30:30,553 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:30:30,571 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-28 02:30:30,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:30:30,754 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:30:30,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:30:30,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1640374883, now seen corresponding path program 1 times [2024-11-28 02:30:30,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:30:30,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328710202] [2024-11-28 02:30:30,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:30:30,756 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-28 02:30:30,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:30:30,758 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:30:30,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:30:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:30:31,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 02:30:31,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:30:31,892 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 8 treesize of output 1 [2024-11-28 02:30:32,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-28 02:30:32,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:30:32,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 31 [2024-11-28 02:30:32,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:30:32,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 70 [2024-11-28 02:30:33,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:30:33,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 38 [2024-11-28 02:30:33,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 314 proven. 9 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2024-11-28 02:30:33,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:30:33,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-28 02:30:33,809 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:30:33,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328710202] [2024-11-28 02:30:33,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328710202] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-28 02:30:33,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 02:30:33,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2024-11-28 02:30:33,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784399666] [2024-11-28 02:30:33,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:30:33,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:30:33,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:30:33,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:30:33,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-28 02:30:33,812 INFO L87 Difference]: Start difference. First operand 321 states and 455 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-28 02:30:34,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:30:34,516 INFO L93 Difference]: Finished difference Result 648 states and 915 transitions. [2024-11-28 02:30:34,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:30:34,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2024-11-28 02:30:34,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:30:34,521 INFO L225 Difference]: With dead ends: 648 [2024-11-28 02:30:34,521 INFO L226 Difference]: Without dead ends: 330 [2024-11-28 02:30:34,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-11-28 02:30:34,523 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 139 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:30:34,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 617 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 02:30:34,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-28 02:30:34,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 319. [2024-11-28 02:30:34,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 255 states have (on average 1.3254901960784313) internal successors, (338), 257 states have internal predecessors, (338), 56 states have call successors, (56), 7 states have call predecessors, (56), 7 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-28 02:30:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 450 transitions. [2024-11-28 02:30:34,579 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 450 transitions. Word has length 184 [2024-11-28 02:30:34,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:30:34,580 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 450 transitions. [2024-11-28 02:30:34,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-28 02:30:34,580 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 450 transitions. [2024-11-28 02:30:34,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-28 02:30:34,583 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:30:34,584 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:30:34,601 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-28 02:30:34,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:30:34,788 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:30:34,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:30:34,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1848931681, now seen corresponding path program 1 times [2024-11-28 02:30:34,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:30:34,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419241464] [2024-11-28 02:30:34,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:30:34,789 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-28 02:30:34,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:30:34,792 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:30:34,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-28 02:30:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:30:35,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-28 02:30:35,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:30:35,636 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 14 treesize of output 10 [2024-11-28 02:30:35,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-11-28 02:30:36,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:30:36,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 40 [2024-11-28 02:30:37,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:30:37,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 79 [2024-11-28 02:30:37,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:30:37,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 45 [2024-11-28 02:30:37,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 334 proven. 9 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2024-11-28 02:30:37,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:30:38,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-28 02:30:38,302 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:30:38,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419241464] [2024-11-28 02:30:38,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419241464] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-28 02:30:38,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 02:30:38,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2024-11-28 02:30:38,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409888351] [2024-11-28 02:30:38,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:30:38,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:30:38,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:30:38,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:30:38,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-11-28 02:30:38,304 INFO L87 Difference]: Start difference. First operand 319 states and 450 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-28 02:30:38,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:30:38,966 INFO L93 Difference]: Finished difference Result 650 states and 911 transitions. [2024-11-28 02:30:38,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:30:38,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2024-11-28 02:30:38,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:30:38,971 INFO L225 Difference]: With dead ends: 650 [2024-11-28 02:30:38,971 INFO L226 Difference]: Without dead ends: 334 [2024-11-28 02:30:38,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 348 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2024-11-28 02:30:38,973 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 234 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:30:38,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 655 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 02:30:38,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-28 02:30:39,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 237. [2024-11-28 02:30:39,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 191 states have (on average 1.3036649214659686) internal successors, (249), 192 states have internal predecessors, (249), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-28 02:30:39,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 325 transitions. [2024-11-28 02:30:39,040 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 325 transitions. Word has length 184 [2024-11-28 02:30:39,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:30:39,041 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 325 transitions. [2024-11-28 02:30:39,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-28 02:30:39,042 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 325 transitions. [2024-11-28 02:30:39,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-28 02:30:39,045 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:30:39,045 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:30:39,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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)] Ended with exit code 0 [2024-11-28 02:30:39,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:30:39,246 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:30:39,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:30:39,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1859229601, now seen corresponding path program 1 times [2024-11-28 02:30:39,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:30:39,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204698] [2024-11-28 02:30:39,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:30:39,247 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-28 02:30:39,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:30:39,249 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:30:39,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:30:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:30:40,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 02:30:40,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:30:40,150 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 14 treesize of output 10 [2024-11-28 02:30:40,295 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 30 treesize of output 14 [2024-11-28 02:30:40,393 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 25 treesize of output 24 [2024-11-28 02:30:40,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:30:40,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 54 [2024-11-28 02:30:40,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:30:40,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 97 [2024-11-28 02:30:41,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:30:41,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 156 treesize of output 74 [2024-11-28 02:30:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-28 02:30:41,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:30:41,581 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:30:41,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204698] [2024-11-28 02:30:41,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:30:41,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:30:41,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 02:30:41,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196125506] [2024-11-28 02:30:41,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:30:41,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 02:30:41,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:30:41,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 02:30:41,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-28 02:30:41,583 INFO L87 Difference]: Start difference. First operand 237 states and 325 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-28 02:30:45,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:30:45,996 INFO L93 Difference]: Finished difference Result 644 states and 896 transitions. [2024-11-28 02:30:45,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:30:45,996 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), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 184 [2024-11-28 02:30:45,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:30:45,999 INFO L225 Difference]: With dead ends: 644 [2024-11-28 02:30:46,000 INFO L226 Difference]: Without dead ends: 410 [2024-11-28 02:30:46,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-28 02:30:46,001 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 396 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:30:46,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1383 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-28 02:30:46,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-11-28 02:30:46,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 240. [2024-11-28 02:30:46,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 195 states have internal predecessors, (252), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-28 02:30:46,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 328 transitions. [2024-11-28 02:30:46,055 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 328 transitions. Word has length 184 [2024-11-28 02:30:46,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:30:46,056 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 328 transitions. [2024-11-28 02:30:46,056 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), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-28 02:30:46,056 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 328 transitions. [2024-11-28 02:30:46,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-28 02:30:46,058 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:30:46,058 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:30:46,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:30:46,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:30:46,258 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:30:46,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:30:46,259 INFO L85 PathProgramCache]: Analyzing trace with hash 687450303, now seen corresponding path program 1 times [2024-11-28 02:30:46,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:30:46,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929891481] [2024-11-28 02:30:46,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:30:46,260 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-28 02:30:46,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:30:46,262 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:30:46,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:30:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:30:46,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 02:30:46,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:30:46,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-28 02:30:47,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-28 02:30:47,009 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:30:47,009 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:30:47,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929891481] [2024-11-28 02:30:47,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929891481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:30:47,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:30:47,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:30:47,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729836758] [2024-11-28 02:30:47,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:30:47,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:30:47,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:30:47,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:30:47,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:30:47,020 INFO L87 Difference]: Start difference. First operand 240 states and 328 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-28 02:30:47,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:30:47,488 INFO L93 Difference]: Finished difference Result 477 states and 653 transitions. [2024-11-28 02:30:47,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:30:47,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 185 [2024-11-28 02:30:47,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:30:47,491 INFO L225 Difference]: With dead ends: 477 [2024-11-28 02:30:47,491 INFO L226 Difference]: Without dead ends: 240 [2024-11-28 02:30:47,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:30:47,493 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:30:47,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 482 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 02:30:47,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-28 02:30:47,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2024-11-28 02:30:47,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 194 states have (on average 1.288659793814433) internal successors, (250), 195 states have internal predecessors, (250), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-28 02:30:47,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 326 transitions. [2024-11-28 02:30:47,551 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 326 transitions. Word has length 185 [2024-11-28 02:30:47,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:30:47,552 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 326 transitions. [2024-11-28 02:30:47,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-28 02:30:47,552 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 326 transitions. [2024-11-28 02:30:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-28 02:30:47,554 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:30:47,554 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:30:47,570 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-28 02:30:47,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:30:47,755 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:30:47,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:30:47,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1948828444, now seen corresponding path program 1 times [2024-11-28 02:30:47,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:30:47,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42632166] [2024-11-28 02:30:47,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:30:47,756 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-28 02:30:47,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:30:47,758 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:30:47,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:30:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:30:48,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-28 02:30:48,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:30:48,607 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 14 treesize of output 10 [2024-11-28 02:30:48,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-11-28 02:30:49,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2024-11-28 02:30:51,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:30:51,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 52 [2024-11-28 02:30:51,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:30:51,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 104 treesize of output 91 [2024-11-28 02:30:52,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:30:52,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 115 treesize of output 51 [2024-11-28 02:30:52,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 476 proven. 15 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-11-28 02:30:52,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:30:53,683 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:30:53,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42632166] [2024-11-28 02:30:53,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42632166] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:30:53,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [70881551] [2024-11-28 02:30:53,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:30:53,683 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 02:30:53,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 02:30:53,685 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 02:30:53,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-28 02:30:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:30:56,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-28 02:30:56,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:30:56,879 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-28 02:30:57,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-11-28 02:30:58,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:30:58,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2024-11-28 02:30:59,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:30:59,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2024-11-28 02:30:59,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:30:59,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 75 [2024-11-28 02:31:00,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:31:00,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 99 treesize of output 51 [2024-11-28 02:31:00,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 379 proven. 18 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2024-11-28 02:31:00,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:31:01,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [70881551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:31:01,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:31:01,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 35 [2024-11-28 02:31:01,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093097133] [2024-11-28 02:31:01,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:31:01,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-28 02:31:01,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:31:01,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-28 02:31:01,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=1647, Unknown=0, NotChecked=0, Total=1980 [2024-11-28 02:31:01,537 INFO L87 Difference]: Start difference. First operand 240 states and 326 transitions. Second operand has 35 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 12 states have call successors, (48), 10 states have call predecessors, (48), 12 states have return successors, (48), 9 states have call predecessors, (48), 12 states have call successors, (48) [2024-11-28 02:31:22,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 02:31:24,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:31:24,699 INFO L93 Difference]: Finished difference Result 660 states and 906 transitions. [2024-11-28 02:31:24,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-28 02:31:24,700 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 12 states have call successors, (48), 10 states have call predecessors, (48), 12 states have return successors, (48), 9 states have call predecessors, (48), 12 states have call successors, (48) Word has length 186 [2024-11-28 02:31:24,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:31:24,703 INFO L225 Difference]: With dead ends: 660 [2024-11-28 02:31:24,704 INFO L226 Difference]: Without dead ends: 423 [2024-11-28 02:31:24,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 407 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1917 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=1481, Invalid=5659, Unknown=0, NotChecked=0, Total=7140 [2024-11-28 02:31:24,707 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 2173 mSDsluCounter, 2646 mSDsCounter, 0 mSdLazyCounter, 2237 mSolverCounterSat, 857 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2173 SdHoareTripleChecker+Valid, 2817 SdHoareTripleChecker+Invalid, 3094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 857 IncrementalHoareTripleChecker+Valid, 2237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:31:24,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2173 Valid, 2817 Invalid, 3094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [857 Valid, 2237 Invalid, 0 Unknown, 0 Unchecked, 15.9s Time] [2024-11-28 02:31:24,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-28 02:31:24,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 246. [2024-11-28 02:31:24,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 200 states have (on average 1.285) internal successors, (257), 201 states have internal predecessors, (257), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-28 02:31:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 333 transitions. [2024-11-28 02:31:24,775 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 333 transitions. Word has length 186 [2024-11-28 02:31:24,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:31:24,775 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 333 transitions. [2024-11-28 02:31:24,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 12 states have call successors, (48), 10 states have call predecessors, (48), 12 states have return successors, (48), 9 states have call predecessors, (48), 12 states have call successors, (48) [2024-11-28 02:31:24,776 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 333 transitions. [2024-11-28 02:31:24,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-28 02:31:24,777 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:31:24,777 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:31:24,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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)] Ended with exit code 0 [2024-11-28 02:31:24,989 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2024-11-28 02:31:25,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 02:31:25,178 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:31:25,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:31:25,178 INFO L85 PathProgramCache]: Analyzing trace with hash -2087973414, now seen corresponding path program 1 times [2024-11-28 02:31:25,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:31:25,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453589147] [2024-11-28 02:31:25,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:31:25,179 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-28 02:31:25,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:31:25,181 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:31:25,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:31:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:31:25,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 02:31:25,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:31:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-28 02:31:25,802 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:31:25,802 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:31:25,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453589147] [2024-11-28 02:31:25,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453589147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:31:25,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:31:25,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:31:25,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655526037] [2024-11-28 02:31:25,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:31:25,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:31:25,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:31:25,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:31:25,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:31:25,804 INFO L87 Difference]: Start difference. First operand 246 states and 333 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-28 02:31:28,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:31:28,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:31:28,891 INFO L93 Difference]: Finished difference Result 495 states and 671 transitions. [2024-11-28 02:31:28,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:31:28,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 186 [2024-11-28 02:31:28,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:31:28,894 INFO L225 Difference]: With dead ends: 495 [2024-11-28 02:31:28,894 INFO L226 Difference]: Without dead ends: 252 [2024-11-28 02:31:28,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 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-28 02:31:28,896 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:31:28,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 652 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-28 02:31:28,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-28 02:31:28,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2024-11-28 02:31:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 206 states have (on average 1.2766990291262137) internal successors, (263), 207 states have internal predecessors, (263), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-28 02:31:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 339 transitions. [2024-11-28 02:31:28,973 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 339 transitions. Word has length 186 [2024-11-28 02:31:28,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:31:28,974 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 339 transitions. [2024-11-28 02:31:28,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-28 02:31:28,974 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 339 transitions. [2024-11-28 02:31:28,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-28 02:31:28,976 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:31:28,976 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:31:28,992 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:31:29,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:31:29,177 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:31:29,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:31:29,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1526935512, now seen corresponding path program 1 times [2024-11-28 02:31:29,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:31:29,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485916713] [2024-11-28 02:31:29,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:31:29,179 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-28 02:31:29,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:31:29,181 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:31:29,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5b8f29-ac08-4706-813f-17f9af44dcc0/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process